Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2017.27
URN: urn:nbn:de:0030-drops-70068
URL: https://drops.dagstuhl.de/opus/volltexte/2017/7006/
Dvorák, Zdenek ; Král, Daniel ; Mohar, Bojan
Graphic TSP in Cubic Graphs
| pdf-format: |
|
Abstract
We present a polynomial-time 9/7-approximation algorithm for the graphic TSP for cubic graphs, which improves the previously best approximation factor of 1.3 for 2-connected cubic graphs and drops the requirement of 2-connectivity at the same time. To design our algorithm, we prove that every simple 2-connected cubic n-vertex graph contains a spanning closed walk of length at most 9n/7-1, and that such a walk can be found in polynomial time.
BibTeX - Entry
@InProceedings{dvork_et_al:LIPIcs:2017:7006,
author = {Zdenek Dvor{\'a}k and Daniel Kr{\'a}l and Bojan Mohar},
title = {{Graphic TSP in Cubic Graphs}},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
pages = {27:1--27:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-028-6},
ISSN = {1868-8969},
year = {2017},
volume = {66},
editor = {Heribert Vollmer and Brigitte Vallée},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2017/7006},
URN = {urn:nbn:de:0030-drops-70068},
doi = {10.4230/LIPIcs.STACS.2017.27},
annote = {Keywords: Graphic TSP, approximation algorithms, cubic graphs}
}
| Keywords: | Graphic TSP, approximation algorithms, cubic graphs | |
| Seminar: | 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017) | |
| Issue date: | 2017 | |
| Date of publication: | 06.03.2017 |
