Software Open Access

TheoryInPractice/structural-rounding: Structural Rounding v2.0

Brian Lavallee; Cole Perschon


MARC21 XML Export

<?xml version='1.0' encoding='UTF-8'?>
<record xmlns="http://www.loc.gov/MARC21/slim">
  <leader>00000nmm##2200000uu#4500</leader>
  <controlfield tag="005">20200407082015.0</controlfield>
  <controlfield tag="001">3742343</controlfield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="a">Cole Perschon</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2=" ">
    <subfield code="s">41651</subfield>
    <subfield code="z">md5:0211947b34f70caa3fd143c150e89f69</subfield>
    <subfield code="u">https://zenodo.org/record/3742343/files/TheoryInPractice/structural-rounding-2.0.zip</subfield>
  </datafield>
  <datafield tag="542" ind1=" " ind2=" ">
    <subfield code="l">open</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="c">2020-04-06</subfield>
  </datafield>
  <datafield tag="909" ind1="C" ind2="O">
    <subfield code="p">software</subfield>
    <subfield code="o">oai:zenodo.org:3742343</subfield>
  </datafield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="a">Brian Lavallee</subfield>
  </datafield>
  <datafield tag="245" ind1=" " ind2=" ">
    <subfield code="a">TheoryInPractice/structural-rounding: Structural Rounding v2.0</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
    <subfield code="a">Other (Open)</subfield>
  </datafield>
  <datafield tag="650" ind1="1" ind2="7">
    <subfield code="a">cc-by</subfield>
    <subfield code="2">opendefinition.org</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">&lt;p&gt;The updated version has two major feature additions:&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;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.&lt;/li&gt;
&lt;li&gt;Library reorganization.  The library has been reorganized to support the addition of algorithms for new problems.  See below for a complete list of changes.&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;We have also added two new algorithms in this version.&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;&lt;code&gt;sr_apx.vc.apx.heuristic_apx&lt;/code&gt;: implements a greedy heuristic for vertex cover which always adds the vertex covering the most new edges.&lt;/li&gt;
&lt;li&gt;&lt;code&gt;sr_apx.vc.kernel.lp_kernel&lt;/code&gt;: computes an LP-based kernel of size at most twice the minimum vertex cover using network flow.&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;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.&lt;/p&gt;
&lt;p&gt;List of name changes:&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;&lt;code&gt;src.graph&lt;/code&gt; &amp;rarr; &lt;code&gt;sr_apx.graph&lt;/code&gt;&lt;/li&gt;
&lt;li&gt;&lt;code&gt;src.octset.prescribed_octset&lt;/code&gt; &amp;rarr; &lt;code&gt;sr_apx.bipartite.prescribed_octset&lt;/code&gt;&lt;/li&gt;
&lt;li&gt;&lt;code&gt;src.octset.verify_bip&lt;/code&gt; &amp;rarr; &lt;code&gt;sr_apx.bipartite.verify_bipartite&lt;/code&gt;&lt;/li&gt;
&lt;li&gt;&lt;code&gt;src.octset.find_octset&lt;/code&gt; &amp;rarr; &lt;code&gt;sr_apx.bipartite.vertex_delete&lt;/code&gt;&lt;/li&gt;
&lt;li&gt;&lt;code&gt;src.vc_apx&lt;/code&gt; &amp;rarr; &lt;code&gt;sr_apx.vc.apx&lt;/code&gt;&lt;/li&gt;
&lt;li&gt;&lt;code&gt;src.vc_exact&lt;/code&gt; &amp;rarr; &lt;code&gt;sr_apx.vc.exact&lt;/code&gt;&lt;/li&gt;
&lt;li&gt;&lt;code&gt;src.vc_lift&lt;/code&gt; &amp;rarr; &lt;code&gt;sr_apx.vc.lift&lt;/code&gt;&lt;/li&gt;
&lt;li&gt;&lt;code&gt;src.vc_lift.oct_first_lift&lt;/code&gt; &amp;rarr; &lt;code&gt;sr_apx.vc.lift.oct_lift&lt;/code&gt;&lt;/li&gt;
&lt;li&gt;&lt;code&gt;src.vc_lift.bip_first_lift&lt;/code&gt; &amp;rarr; &lt;code&gt;sr_apx.vc.lift.bip_lift&lt;/code&gt;&lt;/li&gt;
&lt;/ul&gt;</subfield>
  </datafield>
  <datafield tag="773" ind1=" " ind2=" ">
    <subfield code="n">url</subfield>
    <subfield code="i">isSupplementTo</subfield>
    <subfield code="a">https://github.com/TheoryInPractice/structural-rounding/tree/2.0</subfield>
  </datafield>
  <datafield tag="773" ind1=" " ind2=" ">
    <subfield code="n">doi</subfield>
    <subfield code="i">isVersionOf</subfield>
    <subfield code="a">10.5281/zenodo.3401540</subfield>
  </datafield>
  <datafield tag="024" ind1=" " ind2=" ">
    <subfield code="a">10.5281/zenodo.3742343</subfield>
    <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">software</subfield>
  </datafield>
</record>
238
16
views
downloads
All versions This version
Views 238197
Downloads 161
Data volume 338.8 kB41.7 kB
Unique views 163144
Unique downloads 91

Share

Cite as