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
Improved Hardness of Approximating Chromatic Number
KTH, School of Computer Science and Communication (CSC), Theoretical Computer Science, TCS.ORCID iD: 0000-0002-1600-5290
2013 (English)In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques: 16th International Workshop, APPROX 2013, and 17th International Workshop, RANDOM 2013, Berkeley, CA, USA, August 21-23, 2013. Proceedings / [ed] Prasad Raghavendra, Sofya Raskhodnikova, Klaus Jansen, José D. P. Rolim, Springer, 2013, 233-243 p.Conference paper, Published paper (Refereed)
Abstract [en]

We prove that for sufficiently large K, it is NP-hard to color K-colorable graphs with less than 2Ω(K 1/3) colors. This improves the previous result of K versus K1/25 log K in Khot [1].

Place, publisher, year, edition, pages
Springer, 2013. 233-243 p.
Series
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ISSN 0302-9743 ; 8096
Keyword [en]
Chromatic number, K-colorable graphs, NP-hard
National Category
Computer Science
Identifiers
URN: urn:nbn:se:kth:diva-136350DOI: 10.1007/978-3-642-40328-6_17Scopus ID: 2-s2.0-84885224075ISBN: 978-364240327-9 (print)OAI: oai:DiVA.org:kth-136350DiVA: diva2:675836
Conference
16th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2013 and the 17th International Workshop on Randomization and Computation, RANDOM 2013; Berkeley, CA; United States; 21 August 2013 through 23 August 2013
Funder
EU, European Research Council, 6853
Note

QC 20131206

Available from: 2013-12-04 Created: 2013-12-04 Last updated: 2013-12-05Bibliographically approved

Open Access in DiVA

approx13(368 kB)51 downloads
File information
File name FULLTEXT01.pdfFile size 368 kBChecksum SHA-512
029390397b2bf397ba4ace8c7dbc62bef7b1b68b3b103e2359c557bf8937f329616328e793ea44e16ad2eade921725a30e2c46af8569368cd11a95d680e33aa8
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopus

Authority records BETA

Huang, Sangxia

Search in DiVA

By author/editor
Huang, Sangxia
By organisation
Theoretical Computer Science, TCS
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 51 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 38 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