<?xml version="1.0" encoding="UTF-8"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
<channel>
  <title>e-sygoing.link — Publications</title>
  <link>https://e-sygoing.link</link>
  <description>Latest links in the Publications category</description>
  <language>en-us</language>
  <lastBuildDate>Sun, 24 May 2026 07:26:43 -0400</lastBuildDate>
  <atom:link href="https://e-sygoing.link/rss.php?type=new&amp;cid=95161"
             rel="self" type="application/rss+xml"/>
    <item>
    <title>Complexity and Approximation</title>
    <link>https://e-sygoing.link/link/5758663-complexity-and-approximation</link>
    <description>Combinatorial optimization problems and their approximability properties: by G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, M. Protasi  (Springer, 1999).  Table of contents, errata, software supplement and a continuously updated catalog of approximability results.</description>
    <pubDate>Mon, 16 Sep 2024 07:27:28 -0400</pubDate>
    <guid isPermaLink="false">https://e-sygoing.link/go/5758663</guid>
  </item>
    <item>
    <title>Hypertext Bibliography of Measures of Complexity</title>
    <link>https://e-sygoing.link/link/5758662-hypertext-bibliography-of-measures-of-complexity</link>
    <description>Bruce Edmonds; Manchester Metropolitan University.</description>
    <pubDate>Mon, 12 Aug 2024 03:38:09 -0400</pubDate>
    <guid isPermaLink="false">https://e-sygoing.link/go/5758662</guid>
  </item>
  </channel>
</rss>
