Graphic TSP in cubic graphs

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F17%3A10385418" target="_blank" >RIV/00216208:11320/17:10385418 - isvavai.cz</a>

Result on the web

<a href="http://drops.dagstuhl.de/opus/volltexte/2017/7006/" target="_blank" >http://drops.dagstuhl.de/opus/volltexte/2017/7006/</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.4230/LIPIcs.STACS.2017.27" target="_blank" >10.4230/LIPIcs.STACS.2017.27</a>

Result language

angličtina

Original language name

Graphic TSP in cubic graphs

Original language description

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.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project

<a href="/en/project/GBP202%2F12%2FG061" target="_blank" >GBP202/12/G061: Center of excellence - Institute for theoretical computer science (CE-ITI)</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2017

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)

ISBN

978-3-95977-028-6

ISSN

1868-8969

e-ISSN

neuvedeno

Number of pages

13

Pages from-to

1-13

Publisher name

Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik

Place of publication

Dagstuhl, Germany

Event location

Hannover, Germany

Event date

Mar 8, 2017

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—