Constant-factor approximations for asymmetric TSP on nearly-embeddable graphs

Marx, Dániel and Salmasi, A and Sidiropoulos, A (2016) Constant-factor approximations for asymmetric TSP on nearly-embeddable graphs. In: 19th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2016 and the 20th International Workshop on Randomization and Computation, RANDOM 2016. Leibniz International Proceedings in Informatics, LIPIcs (60). Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, 16:1-16:54. ISBN 9783959770187 10.4230/LIPIcs.APPROX-RANDOM.2016.16

[img] Text
Marx_16_3174187_ny.pdf

Download (1MB)
Item Type: Book Section
Uncontrolled Keywords: Trees (mathematics); Underlying surface; Traveling Salesperson Problem; Hamiltonian cycle; Constant factor approximation; TOPOLOGY; Random processes; Polynomial approximation; Optimization; Hamiltonians; Graphic methods; Graph theory; dynamic programming; Directed graphs; Costs; Combinatorial optimization; Nearly-embeddable graphs; Held-Karp LP; Exponential time hypothesis; Asymmetric TSP; Approximation algorithms
Subjects: Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
Divisions: Informatics Laboratory
SWORD Depositor: MTMT Injector
Depositing User: MTMT Injector
Date Deposited: 29 Jan 2017 20:40
Last Modified: 29 Jan 2017 20:40
URI: http://eprints.sztaki.hu/id/eprint/9050

Update Item Update Item