Software Open Access
Brian Lavallee; Cole Perschon
The updated version has two major feature additions:
We have also added two new algorithms in this version.
sr_apx.vc.apx.heuristic_apx
: implements a greedy heuristic for vertex cover which always adds the vertex covering the most new edges.sr_apx.vc.kernel.lp_kernel
: computes an LP-based kernel of size at most twice the minimum vertex cover using network flow.A few minor conveniences have also been added to main.py. The new main.cpp roughly replicates the features of main.py, but does not write results to file.
List of name changes:
src.graph
→ sr_apx.graph
src.octset.prescribed_octset
→ sr_apx.bipartite.prescribed_octset
src.octset.verify_bip
→ sr_apx.bipartite.verify_bipartite
src.octset.find_octset
→ sr_apx.bipartite.vertex_delete
src.vc_apx
→ sr_apx.vc.apx
src.vc_exact
→ sr_apx.vc.exact
src.vc_lift
→ sr_apx.vc.lift
src.vc_lift.oct_first_lift
→ sr_apx.vc.lift.oct_lift
src.vc_lift.bip_first_lift
→ sr_apx.vc.lift.bip_lift
Name | Size | |
---|---|---|
TheoryInPractice/structural-rounding-2.0.zip
md5:0211947b34f70caa3fd143c150e89f69 |
41.7 kB | Download |
All versions | This version | |
---|---|---|
Views | 225 | 184 |
Downloads | 16 | 1 |
Data volume | 338.8 kB | 41.7 kB |
Unique views | 153 | 134 |
Unique downloads | 9 | 1 |