Optimal long code test with one free bit

Nikhil Bansal, Subhash Khot

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

For arbitrarily small constants ε, δ > 0, we present a long code test with one free bit, completeness 1 - ε and soundness δ. Using the test, we prove the following two inapproximability results: 1) Assuming the Unique Games Conjecture of Khot [15], given an n-vertex graph that has two disjoint independent sets of size (1/2 - ε)n each, it is NP-hard to find an independent set of size δn. 2) Assuming a (new) stronger version of the Unique Games Conjecture, the scheduling problem of minimizing weighted completion time with precedence constraints is inapprox-imable within factor 2 - ε.

Original languageEnglish (US)
Title of host publicationProceedings - 50th Annual Symposium on Foundations of Computer Science, FOCS 2009
Pages453-462
Number of pages10
DOIs
StatePublished - 2009
Event50th Annual Symposium on Foundations of Computer Science, FOCS 2009 - Atlanta, GA, United States
Duration: Oct 25 2009Oct 27 2009

Other

Other50th Annual Symposium on Foundations of Computer Science, FOCS 2009
CountryUnited States
CityAtlanta, GA
Period10/25/0910/27/09

Fingerprint

Scheduling

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Bansal, N., & Khot, S. (2009). Optimal long code test with one free bit. In Proceedings - 50th Annual Symposium on Foundations of Computer Science, FOCS 2009 (pp. 453-462). [5438609] https://doi.org/10.1109/FOCS.2009.23

Optimal long code test with one free bit. / Bansal, Nikhil; Khot, Subhash.

Proceedings - 50th Annual Symposium on Foundations of Computer Science, FOCS 2009. 2009. p. 453-462 5438609.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Bansal, N & Khot, S 2009, Optimal long code test with one free bit. in Proceedings - 50th Annual Symposium on Foundations of Computer Science, FOCS 2009., 5438609, pp. 453-462, 50th Annual Symposium on Foundations of Computer Science, FOCS 2009, Atlanta, GA, United States, 10/25/09. https://doi.org/10.1109/FOCS.2009.23
Bansal N, Khot S. Optimal long code test with one free bit. In Proceedings - 50th Annual Symposium on Foundations of Computer Science, FOCS 2009. 2009. p. 453-462. 5438609 https://doi.org/10.1109/FOCS.2009.23
Bansal, Nikhil ; Khot, Subhash. / Optimal long code test with one free bit. Proceedings - 50th Annual Symposium on Foundations of Computer Science, FOCS 2009. 2009. pp. 453-462
@inproceedings{ab2e297aabcf46c8b5bf7623a9b820e6,
title = "Optimal long code test with one free bit",
abstract = "For arbitrarily small constants ε, δ > 0, we present a long code test with one free bit, completeness 1 - ε and soundness δ. Using the test, we prove the following two inapproximability results: 1) Assuming the Unique Games Conjecture of Khot [15], given an n-vertex graph that has two disjoint independent sets of size (1/2 - ε)n each, it is NP-hard to find an independent set of size δn. 2) Assuming a (new) stronger version of the Unique Games Conjecture, the scheduling problem of minimizing weighted completion time with precedence constraints is inapprox-imable within factor 2 - ε.",
author = "Nikhil Bansal and Subhash Khot",
year = "2009",
doi = "10.1109/FOCS.2009.23",
language = "English (US)",
isbn = "9780769538501",
pages = "453--462",
booktitle = "Proceedings - 50th Annual Symposium on Foundations of Computer Science, FOCS 2009",

}

TY - GEN

T1 - Optimal long code test with one free bit

AU - Bansal, Nikhil

AU - Khot, Subhash

PY - 2009

Y1 - 2009

N2 - For arbitrarily small constants ε, δ > 0, we present a long code test with one free bit, completeness 1 - ε and soundness δ. Using the test, we prove the following two inapproximability results: 1) Assuming the Unique Games Conjecture of Khot [15], given an n-vertex graph that has two disjoint independent sets of size (1/2 - ε)n each, it is NP-hard to find an independent set of size δn. 2) Assuming a (new) stronger version of the Unique Games Conjecture, the scheduling problem of minimizing weighted completion time with precedence constraints is inapprox-imable within factor 2 - ε.

AB - For arbitrarily small constants ε, δ > 0, we present a long code test with one free bit, completeness 1 - ε and soundness δ. Using the test, we prove the following two inapproximability results: 1) Assuming the Unique Games Conjecture of Khot [15], given an n-vertex graph that has two disjoint independent sets of size (1/2 - ε)n each, it is NP-hard to find an independent set of size δn. 2) Assuming a (new) stronger version of the Unique Games Conjecture, the scheduling problem of minimizing weighted completion time with precedence constraints is inapprox-imable within factor 2 - ε.

UR - http://www.scopus.com/inward/record.url?scp=77952368191&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77952368191&partnerID=8YFLogxK

U2 - 10.1109/FOCS.2009.23

DO - 10.1109/FOCS.2009.23

M3 - Conference contribution

SN - 9780769538501

SP - 453

EP - 462

BT - Proceedings - 50th Annual Symposium on Foundations of Computer Science, FOCS 2009

ER -