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 inapproximability for TSP
KTH, School of Computer Science and Communication (CSC), Theoretical Computer Science, TCS.
2012 (English)In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, Springer-Verlag , 2012, 243-253 p.Conference paper, Published paper (Refereed)
Abstract [en]

The Traveling Salesman Problem is one of the most studied problems in computational complexity and its approximability has been a long standing open question. Currently, the best known inapproximability threshold known is 220/219 due to Papadimitriou and Vempala. Here, using an essentially different construction and also relying on the work of Berman and Karpinski on bounded occurrence CSPs, we give an alternative and simpler inapproximability proof which improves the bound to 185/184.

Place, publisher, year, edition, pages
Springer-Verlag , 2012. 243-253 p.
Series
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ISSN 0302-9743 ; 7408 LNCS
Keyword [en]
Approximability, Inapproximability, Combinatorial optimization, Traveling salesman problem, Approximation algorithms
National Category
Computer and Information Science
Identifiers
URN: urn:nbn:se:kth:diva-104875DOI: 10.1007/978-3-642-32512-0_21Scopus ID: 2-s2.0-84865301246ISBN: 978-364232511-3 (print)OAI: oai:DiVA.org:kth-104875DiVA: diva2:567827
Conference
15th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2012 and the 16th International Workshop on Randomization and Computation, RANDOM 2012, 15 August 2012 through 17 August 2012, Cambridge, MA
Note

QC 20121114

Available from: 2012-11-14 Created: 2012-11-14 Last updated: 2016-12-21Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopushttp://arxiv.org/abs/1206.2497http://cui.unige.ch/tcs/random-approx/2012/

Search in DiVA

By author/editor
Lampis, Michail
By organisation
Theoretical Computer Science, TCS
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

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