Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Balanced Max 2-Sat Might Not be the Hardest: PROCEEDINGS OF THE 39TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING
KTH, School of Computer Science and Communication (CSC), Theoretical Computer Science, TCS.ORCID iD: 0000-0001-8217-0158
2007 (English)In: STOC 07: PROCEEDINGS OF THE 39TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, New York: ASSOC COMPUTING MACHINERY, , 2007, 189-197 p.Conference paper, Published paper (Refereed)
Abstract [en]

We show that, assuming the Unique Games Conjecture, it is NP-hard to approximate MAX 2-SAT within alpha(-)(L)(LZ)+epsilon where 0.9401 < alpha(-)(L)(LZ) < 0.9402 is the believed approximation ratio of the algorithm of Lewin, Livnat and Zwick [28].. This result is surprising considering the fact that balanced instances of MAX 2-SAT, i.e., instances where each variable occurs positively and negatively equally often, can be approximated within 0.9439. In particular, instances in which roughly 68% of the literals are unnegated variables and 32% are negated appear less amenable to approximation than instances where the ratio is 50%-50%.

Place, publisher, year, edition, pages
New York: ASSOC COMPUTING MACHINERY, , 2007. 189-197 p.
Series
Annual ACM Symposium on Theory of Computing, ISSN 0737-8017
Keyword [en]
Max 2-Sat, Unique Games Conjecture, Inapproximability
National Category
Computer Science
Identifiers
URN: urn:nbn:se:kth:diva-30814DOI: 10.1145/1250790.1250818ISI: 000267050000021Scopus ID: 2-s2.0-35448957666ISBN: 978-1-59593-631-8 (print)OAI: oai:DiVA.org:kth-30814DiVA: diva2:403193
Conference
39th Annual ACM Symposium on Theory of Computing San Diego, CA, JUN 11-13, 2007
Note

QC 20110311

Available from: 2011-03-11 Created: 2011-03-04 Last updated: 2016-06-20Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Authority records BETA

Austrin, Per

Search in DiVA

By author/editor
Austrin, Per
By organisation
Theoretical Computer Science, TCS
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 125 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf