Improved Lower Bounds on the Approximability of the Traveling Salesman Problem
RAIRO-Theor. Inf. Appl., 34 3 (2000) 213-255
Published online: 2002-04-15
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
On the Approximability of the Single Allocation p-Hub Center Problem with Parameterized Triangle Inequality
Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung and Ralf KlasingAlgorithmica 84 (7) 1993 (2022)
https://doi.org/10.1007/s00453-022-00941-z
126 (2020)
https://doi.org/10.1109/ICS51289.2020.00034
Approximation algorithms for the p-hub center routing problem in parameterized metric graphs
Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung and Ralf KlasingTheoretical Computer Science 806 271 (2020)
https://doi.org/10.1016/j.tcs.2019.05.008
Combinatorial Algorithms
Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung and Ralf KlasingLecture Notes in Computer Science, Combinatorial Algorithms 10979 115 (2018)
https://doi.org/10.1007/978-3-319-94667-2_10
Approximability and inapproximability of the star p-hub center problem with parameterized triangle inequality
Li-Hsuan Chen, Dun-Wei Cheng, Sun-Yuan Hsieh, et al.Journal of Computer and System Sciences 92 92 (2018)
https://doi.org/10.1016/j.jcss.2017.09.012
11011 393 (2018)
https://doi.org/10.1007/978-3-319-98355-4_22
10392 112 (2017)
https://doi.org/10.1007/978-3-319-62389-4_10
10236 152 (2017)
https://doi.org/10.1007/978-3-319-57586-5_14
Guest column
Michael LampisACM SIGACT News 45 (1) 48 (2014)
https://doi.org/10.1145/2596583.2596599
Algorithms and Computation
Marek Karpinski, Michael Lampis and Richard SchmiedLecture Notes in Computer Science, Algorithms and Computation 8283 568 (2013)
https://doi.org/10.1007/978-3-642-45030-3_53
Computer Science – Theory and Applications
Juraj HromkovičLecture Notes in Computer Science, Computer Science – Theory and Applications 6072 181 (2010)
https://doi.org/10.1007/978-3-642-13182-0_17
On k-connectivity problems with sharpened triangle inequality
Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovič, et al.Journal of Discrete Algorithms 6 (4) 605 (2008)
https://doi.org/10.1016/j.jda.2008.03.003
SOFSEM 2008: Theory and Practice of Computer Science
Hans-Joachim Böckenhauer, Juraj Hromkovič, Tobias Mömke and Peter WidmayerLecture Notes in Computer Science, SOFSEM 2008: Theory and Practice of Computer Science 4910 50 (2008)
https://doi.org/10.1007/978-3-540-77566-9_5
Fourth IFIP International Conference on Theoretical Computer Science- TCS 2006
Hans-Joachim Böckenhauer, Luca Forlizzi, Juraj Hromkovič, et al.IFIP International Federation for Information Processing, Fourth IFIP International Conference on Theoretical Computer Science- TCS 2006 209 251 (2006)
https://doi.org/10.1007/978-0-387-34735-6_21
TSP with bounded metrics
Lars Engebretsen and Marek KarpinskiJournal of Computer and System Sciences 72 (4) 509 (2006)
https://doi.org/10.1016/j.jcss.2005.12.001
Algorithm Theory – SWAT 2006
Hans-Joachim Böckenhauer, Juraj Hromkovič, Joachim Kneis and Joachim KupkeLecture Notes in Computer Science, Algorithm Theory – SWAT 2006 4059 184 (2006)
https://doi.org/10.1007/11785293_19
Exploring New Frontiers of Theoretical Informatics
Juraj HromkovičIFIP International Federation for Information Processing, Exploring New Frontiers of Theoretical Informatics 155 3 (2004)
https://doi.org/10.1007/1-4020-8141-3_2
On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality
Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovič, et al.Theoretical Computer Science 326 (1-3) 137 (2004)
https://doi.org/10.1016/j.tcs.2004.06.019
Algorithms and Complexity
Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovič, et al.Lecture Notes in Computer Science, Algorithms and Complexity 2653 189 (2003)
https://doi.org/10.1007/3-540-44849-7_24
Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : de la structure de NPO à la structure des instances
Marc Demange and Vangelis PaschosRAIRO - Operations Research 36 (4) 311 (2002)
https://doi.org/10.1051/ro:2003009
FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science
Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovič, et al.Lecture Notes in Computer Science, FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science 2556 59 (2002)
https://doi.org/10.1007/3-540-36206-1_7
Automata, Languages and Programming
Lars Engebretsen and Marek KarpinskiLecture Notes in Computer Science, Automata, Languages and Programming 2076 201 (2001)
https://doi.org/10.1007/3-540-48224-5_17
Algorithmics for Hard Problems
Juraj HromkovičTexts in Theoretical Computer Science An EATCS Series, Algorithmics for Hard Problems 213 (2001)
https://doi.org/10.1007/978-3-662-04616-6_4