research

Inapproximability of Combinatorial Optimization Problems

Authors
Publication date
1 January 2004
Publisher
View on arXiv

Abstract

We survey results on the hardness of approximating combinatorial optimization problems

    Similar works

    Full text

    thumbnail-image

    Available Versions

    CiteSeerX

    redirect
    oaioai:CiteSeerX.psu:10.1.1.72.56...
    Last time updated on 22/10/2014

    CiteSeerX

    redirect
    oaioai:CiteSeerX.psu:10.1.1.519.1...
    Last time updated on 28/10/2017

    CiteSeerX

    redirect
    oaioai:CiteSeerX.psu:10.1.1.504.5...
    Last time updated on 28/10/2017