Software Open Access

TheoryInPractice/structural-rounding: Structural Rounding v2.0

Brian Lavallee; Cole Perschon


DataCite XML Export

<?xml version='1.0' encoding='utf-8'?>
<resource xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://datacite.org/schema/kernel-4" xsi:schemaLocation="http://datacite.org/schema/kernel-4 http://schema.datacite.org/meta/kernel-4.1/metadata.xsd">
  <identifier identifierType="DOI">10.5281/zenodo.3742343</identifier>
  <creators>
    <creator>
      <creatorName>Brian Lavallee</creatorName>
    </creator>
    <creator>
      <creatorName>Cole Perschon</creatorName>
    </creator>
  </creators>
  <titles>
    <title>TheoryInPractice/structural-rounding: Structural Rounding v2.0</title>
  </titles>
  <publisher>Zenodo</publisher>
  <publicationYear>2020</publicationYear>
  <dates>
    <date dateType="Issued">2020-04-06</date>
  </dates>
  <resourceType resourceTypeGeneral="Software"/>
  <alternateIdentifiers>
    <alternateIdentifier alternateIdentifierType="url">https://zenodo.org/record/3742343</alternateIdentifier>
  </alternateIdentifiers>
  <relatedIdentifiers>
    <relatedIdentifier relatedIdentifierType="URL" relationType="IsSupplementTo">https://github.com/TheoryInPractice/structural-rounding/tree/2.0</relatedIdentifier>
    <relatedIdentifier relatedIdentifierType="DOI" relationType="IsVersionOf">10.5281/zenodo.3401540</relatedIdentifier>
  </relatedIdentifiers>
  <version>2.0</version>
  <rightsList>
    <rights rightsURI="info:eu-repo/semantics/openAccess">Open Access</rights>
  </rightsList>
  <descriptions>
    <description descriptionType="Abstract">&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;</description>
  </descriptions>
</resource>
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