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
Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs
KTH, School of Computer Science and Communication (CSC), Theoretical Computer Science, TCS.ORCID iD: 0000-0001-8217-0158
2009 (English)In: PROCEEDINGS OF THE 24TH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, 2009, 74-80 p.Conference paper, Published paper (Refereed)
Abstract [en]

We study the inapproximability of Vertex Cover and Independent Set on degree d graphs. We prove that: Vertex Cover is Unique Games-hard to approximate to within a factor 2 - (2 + O-d (1)) log logd/log d. This exactly matches the algorithmic result of Halperin [1] up to the O-d(1) term. Independent Set is Unique Games-hard to approximate to within a factor O(d/log(2)d). This improves the d/log(O(1)) (d) Unique Games hardness result of Samorodnitsky and Trevisan [2]. Additionally, our result does not rely on the construction of a query efficient PCP as in [2].

Place, publisher, year, edition, pages
2009. 74-80 p.
Series
Annual IEEE Conference on Computational Complexity, ISSN 1093-0159
Keyword [en]
APPROXIMATE, ALGORITHMS, CLIQUE, MIGHT, HARD; CUT
National Category
Computer Science
Identifiers
URN: urn:nbn:se:kth:diva-30377DOI: 10.1109/CCC.2009.38ISI: 000273015300009Scopus ID: 2-s2.0-70350626961ISBN: 978-0-7695-3717-7 (print)OAI: oai:DiVA.org:kth-30377DiVA: diva2:401304
Conference
24th Annual IEEE Conference on Computational Complexity, Paris, FRANCE, JUL 15-18, 2009
Note
QC 20110302Available from: 2011-03-02 Created: 2011-02-24 Last updated: 2011-03-02Bibliographically 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: 58 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