Deterministic 7/8-Approximation for the Metric Maximum TSP

DOI10.1007/978-3-540-85363-3_11MaRDI QIDQ3541791zbMATH OpenOpenAlexFDO

Authors Łukasz Kowalik, Marcin Mucha

Publication date 27 November 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-85363-3_11

Mathematics Subject Classification ID

Approximation algorithms (68W25) Combinatorial optimization (90C27)

Recommendations

• Deterministic 7/8-approximation for the metric maximum TSP
• scientific article; zbMATH DE number 1830734
• A \(\frac78\)-approximation algorithm for metric Max TSP
• A deterministic better-than-3/2 approximation algorithm for metric TSP
• Improved deterministic approximation algorithms for max TSP
• Improved approximation algorithms for metric MaxTSP
• Algorithms – ESA 2005
• A (slightly) improved approximation algorithm for metric TSP
• scientific article; zbMATH DE number 2119645
• An -approximation algorithm for the asymmetric maximum TSP

Cites work

• 35/44-Approximation for Asymmetric Maximum TSP with Triangle Inequality
• A \(\frac78\)-approximation algorithm for metric Max TSP
• Algorithms – ESA 2005
• scientific article; zbMATH DE number 3910163 (Why is no real title available?)

Cited in

(5)

• Deterministic 7/8-approximation for the metric maximum TSP
• Exponential approximation schemata for some network design problems
• scientific article; zbMATH DE number 1830734 (Why is no real title available?)
• Algorithms – ESA 2005
• A deterministic better-than-3/2 approximation algorithm for metric TSP

This page was built for publication: Deterministic 7/8-Approximation for the Metric Maximum TSP

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3541791)