• DocumentCode
    3217315
  • Title

    Proving integrality gaps without knowing the linear program

  • Author

    Arora, Sanjeev ; Bollobás, Béla ; Lovász, László

  • Author_Institution
    Princeton Univ., NJ, USA
  • fYear
    2002
  • fDate
    2002
  • Firstpage
    313
  • Lastpage
    322
  • Abstract
    Proving integrality gaps for linear relaxations of NP optimization problems is a difficult task and usually undertaken on a case-by-case basis. We initiate a more systematic approach. We prove an integrality gap of 2-o(1) for three families of linear relaxations for vertex cover, and our methods seem relevant to other problems as well.
  • Keywords
    graph theory; linear programming; NP optimization problems; graph theory; integrality gap proving; linear program; linear relaxations; vertex cover; Approximation algorithms; Computational modeling; Computer science; Cost function; Educational institutions; Ellipsoids; Linear programming; NP-hard problem; Polynomials; Upper bound;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Foundations of Computer Science, 2002. Proceedings. The 43rd Annual IEEE Symposium on
  • ISSN
    0272-5428
  • Print_ISBN
    0-7695-1822-2
  • Type

    conf

  • DOI
    10.1109/SFCS.2002.1181954
  • Filename
    1181954
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3217315