IDEAS home Printed from https://ideas.repec.org/a/inm/ormoor/v44y2019i1p147-172.html
   My bibliography  Save this article

No Small Linear Program Approximates Vertex Cover Within a Factor 2 − ɛ

Author

Listed:
  • Abbas Bazzi

    (School of Computer and Communication Sciences, École Polytechnique Fédérale de Lausanne, Lausanne, France CH-1015)

  • Samuel Fiorini

    (Département de Mathématique, Université Libre de Bruxelles, Brussels, Belgium B-1050)

  • Sebastian Pokutta

    (H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30318)

  • Ola Svensson

    (School of Computer and Communication Sciences, École Polytechnique Fédérale de Lausanne, Lausanne, France CH-1015)

Abstract

The vertex cover problem is one of the most important and intensively studied combinatorial optimization problems. Khot and Regev [Khot S, Regev O (2008) Vertex cover might be hard to approximate to within 2 − ɛ . J. Comput. System Sci. 74(3):335–349] proved that the problem is NP-hard to approximate within a factor 2 − ɛ , assuming the unique games conjecture (UGC). This is tight because the problem has an easy 2-approximation algorithm. Without resorting to the UGC, the best inapproximability result for the problem is due to Dinur and Safra [Dinur I, Safra S (2005) On the hardness of approximating minimum vertex cover. Ann. Math. 162(1):439–485]: vertex cover is NP-hard to approximate within a factor 1.3606. We prove the following unconditional result about linear programming (LP) relaxations of the problem: every LP relaxation that approximates the vertex cover within a factor 2 − ɛ has super-polynomially many inequalities. As a direct consequence of our methods, we also establish that LP relaxations (as well as semidefinite programming relaxations) that approximate the independent set problem within any constant factor have a super-polynomial size.

Suggested Citation

  • Abbas Bazzi & Samuel Fiorini & Sebastian Pokutta & Ola Svensson, 2019. "No Small Linear Program Approximates Vertex Cover Within a Factor 2 − ɛ," Mathematics of Operations Research, INFORMS, vol. 44(1), pages 147-172, February.
    • Handle: RePEc:inm:ormoor:v:44:y:2019:i:1:p:147-172
    DOI: 10.1287/moor.2017.0918
    as

    Download full text from publisher

    File URL: https://doi.org/10.1287/moor.2017.0918
    Download Restriction: no
    File URL: https://libkey.io/10.1287/moor.2017.0918?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Gábor Braun & Samuel Fiorini & Sebastian Pokutta & David Steurer, 2015. "Approximation Limits of Linear Programs (Beyond Hierarchies)," Mathematics of Operations Research, INFORMS, vol. 40(3), pages 756-772, March.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Gusev, Vasily V., 2023. "Set-weighted games and their application to the cover problem," European Journal of Operational Research, Elsevier, vol. 305(1), pages 438-450.
    2. Vasily V. Gusev, 2021. "Set-weighted games and their application to the cover problem," HSE Working papers WP BRP 247/EC/2021, National Research University Higher School of Economics.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Flemming Holtorf & Paul I. Barton, 2024. "Tighter Bounds on Transient Moments of Stochastic Chemical Systems," Journal of Optimization Theory and Applications, Springer, vol. 200(1), pages 104-149, January.
    2. Gribling, Sander & Laat, David de & Laurent, Monique, 2017. "Lower Bounds on Matrix Factorization Ranks via Noncommutative Polynomial Optimization," Other publications TiSEM 2dddf156-3d4b-4936-bf02-a, Tilburg University, School of Economics and Management.
    3. Ken Kobayashi & Yuich Takano, 2020. "A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems," Computational Optimization and Applications, Springer, vol. 75(2), pages 493-513, March.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormoor:v:44:y:2019:i:1:p:147-172. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.