Software Open Access

TheoryInPractice/structural-rounding: Structural Rounding v2.0

Brian Lavallee; Cole Perschon

The updated version has two major feature additions:

  • C++ back-end. Every algorithm in the library is now implemented in C++. Python wrappers have also been provided to continue support for python scripting. The switch to C++ improves overall runtimes by ~10x.
  • Library reorganization. The library has been reorganized to support the addition of algorithms for new problems. See below for a complete list of changes.

We have also added two new algorithms in this version.

  • implements a greedy heuristic for vertex cover which always adds the vertex covering the most new edges.
  • 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 The new main.cpp roughly replicates the features of, but does not write results to file.

List of name changes:

  • src.graphsr_apx.graph
  • src.octset.prescribed_octsetsr_apx.bipartite.prescribed_octset
  • src.octset.verify_bipsr_apx.bipartite.verify_bipartite
  • src.octset.find_octsetsr_apx.bipartite.vertex_delete
Files (41.7 kB)
Name Size
41.7 kB Download
All versions This version
Views 280238
Downloads 171
Data volume 358.6 kB41.7 kB
Unique views 195175
Unique downloads 101


Cite as