research

Lagrangian Relaxation and Partial Cover

Authors
Publication date
23 December 2007
Publisher
View on arXiv

Abstract

Lagrangian relaxation has been used extensively in the design of approximation algorithms. This paper studies its strengths and limitations when applied to Partial Cover.Comment: 20 pages, extended abstract appeared in STACS 200

    Similar works

    Full text

    thumbnail-image

    Available Versions

    MPG.PuRe

    redirect
    oaioai:escidoc.org:escidoc:132560...
    Last time updated on 23/08/2016

    MPG.PuRe

    redirect
    oaioai:pure.mpg.de:item_1325606
    Last time updated on 15/06/2019

    Max Planck Society eDoc Server

    redirect
    oaioai:edoc.mpg.de:428166
    Last time updated on 23/08/2016