• DocumentCode
    1698368
  • Title

    Hardness of Finding Independent Sets in Almost 3-Colorable Graphs

  • Author

    Dinur, Irit ; Khot, Subhash ; Perkins, Will ; Safra, Muli

  • Author_Institution
    Weizmann Inst., Rehovot, Israel
  • fYear
    2010
  • Firstpage
    212
  • Lastpage
    221
  • Abstract
    For every ∈ > 0, and integer q ≥ 3, we show that given an N-vertex graph that has an induced q-colorable subgraph of size (1 - ∈)N, it is NP-hard to find an independent set of size N/q2.
  • Keywords
    approximation theory; graph colouring; optimisation; set theory; NP-hardness; V-vertex graph; colorable graph; independent sets finding; Approximation methods; Color; Coordinate measuring machines; Games; Polynomials; Search problems; Weight measurement; PCPs; graph coloring; hardness of approximation;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Foundations of Computer Science (FOCS), 2010 51st Annual IEEE Symposium on
  • Conference_Location
    Las Vegas, NV
  • ISSN
    0272-5428
  • Print_ISBN
    978-1-4244-8525-3
  • Type

    conf

  • DOI
    10.1109/FOCS.2010.84
  • Filename
    5670828
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1698368