<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0">
  <channel>
    <title>PyPI recent updates for baldor</title>
    <link>https://pypi.org/project/baldor/</link>
    <description>Recent updates to the Python Package Index for baldor</description>
    <language>en</language>    <item>
      <title>0.1.4</title>
      <link>https://pypi.org/project/baldor/0.1.4/</link>
      <description>Solve the Approximate Minimum Dominating Set for undirected graph encoded in DIMACS format.</description>
<author>vega.frank@gmail.com</author>      <pubDate>Thu, 05 Jun 2025 16:11:56 GMT</pubDate>
    </item>    <item>
      <title>0.1.3</title>
      <link>https://pypi.org/project/baldor/0.1.3/</link>
      <description>Solve the Approximate Minimum Dominating Set for undirected graph encoded in DIMACS format.</description>
<author>vega.frank@gmail.com</author>      <pubDate>Sun, 06 Apr 2025 02:44:31 GMT</pubDate>
    </item>    <item>
      <title>0.1.2</title>
      <link>https://pypi.org/project/baldor/0.1.2/</link>
      <description>Solve the Approximate Minimum Dominating Set for undirected graph encoded in DIMACS format.</description>
<author>vega.frank@gmail.com</author>      <pubDate>Sun, 06 Apr 2025 00:31:14 GMT</pubDate>
    </item>    <item>
      <title>0.1.1</title>
      <link>https://pypi.org/project/baldor/0.1.1/</link>
      <description>Solve the Minimum Dominating Set for undirected graph encoded in DIMACS format.</description>
<author>vega.frank@gmail.com</author>      <pubDate>Thu, 20 Mar 2025 13:57:20 GMT</pubDate>
    </item>    <item>
      <title>0.1.0</title>
      <link>https://pypi.org/project/baldor/0.1.0/</link>
      <description>Solve the Minimum Dominating Set for undirected graph encoded in DIMACS format.</description>
<author>vega.frank@gmail.com</author>      <pubDate>Thu, 20 Mar 2025 12:50:45 GMT</pubDate>
    </item>    <item>
      <title>0.0.9</title>
      <link>https://pypi.org/project/baldor/0.0.9/</link>
      <description>Estimating the Minimum Dominating Set with a 8-approximation ratio for undirected graph encoded in DIMACS format.</description>
<author>vega.frank@gmail.com</author>      <pubDate>Thu, 06 Mar 2025 23:54:23 GMT</pubDate>
    </item>    <item>
      <title>0.0.8</title>
      <link>https://pypi.org/project/baldor/0.0.8/</link>
      <description>Estimating the Minimum Dominating Set with a 8-approximation ratio for undirected graph encoded in DIMACS format.</description>
<author>vega.frank@gmail.com</author>      <pubDate>Thu, 06 Mar 2025 14:34:56 GMT</pubDate>
    </item>    <item>
      <title>0.0.7</title>
      <link>https://pypi.org/project/baldor/0.0.7/</link>
      <description>Estimating the Minimum Dominating Set with a sublogarithmic-approximation ratio for undirected graph encoded in DIMACS format.</description>
<author>vega.frank@gmail.com</author>      <pubDate>Wed, 05 Mar 2025 05:49:14 GMT</pubDate>
    </item>    <item>
      <title>0.0.6</title>
      <link>https://pypi.org/project/baldor/0.0.6/</link>
      <description>Estimating the Minimum Dominating Set with a sublogarithmic-approximation ratio for undirected graph encoded in DIMACS format.</description>
<author>vega.frank@gmail.com</author>      <pubDate>Wed, 05 Mar 2025 05:41:41 GMT</pubDate>
    </item>    <item>
      <title>0.0.5</title>
      <link>https://pypi.org/project/baldor/0.0.5/</link>
      <description>Estimating the Minimum Dominating Set with a sublogarithmic approximation ratio for undirected graph encoded in DIMACS format.</description>
<author>vega.frank@gmail.com</author>      <pubDate>Tue, 04 Mar 2025 19:51:23 GMT</pubDate>
    </item>    <item>
      <title>0.0.4</title>
      <link>https://pypi.org/project/baldor/0.0.4/</link>
      <description>Estimating the Minimum Dominating Set with a sublogarithmic approximation ratio for undirected graph encoded in DIMACS format.</description>
<author>vega.frank@gmail.com</author>      <pubDate>Tue, 04 Mar 2025 04:00:32 GMT</pubDate>
    </item>    <item>
      <title>0.0.3</title>
      <link>https://pypi.org/project/baldor/0.0.3/</link>
      <description>Estimating the Minimum Vertex Cover for an undirected graph encoded in DIMACS format and stored in a file.</description>
<author>vega.frank@gmail.com</author>      <pubDate>Thu, 13 Feb 2025 12:22:50 GMT</pubDate>
    </item>    <item>
      <title>0.0.2</title>
      <link>https://pypi.org/project/baldor/0.0.2/</link>
      <description>Estimating the Minimum Vertex Cover for an undirected graph encoded in DIMACS format and stored in a file.</description>
<author>vega.frank@gmail.com</author>      <pubDate>Thu, 13 Feb 2025 10:58:47 GMT</pubDate>
    </item>    <item>
      <title>0.0.1</title>
      <link>https://pypi.org/project/baldor/0.0.1/</link>
      <description>Estimating the Minimum Vertex Cover for an undirected graph encoded in DIMACS format and stored in a file.</description>
<author>vega.frank@gmail.com</author>      <pubDate>Thu, 13 Feb 2025 08:59:13 GMT</pubDate>
    </item>  </channel>
</rss>