Asymptotically optimal algorithms for geometric MAX TSP and MAX \(m\)-PSP

DOI10.1016/j.dam.2012.09.007zbMath1282.05205OpenAlexW2009378720MaRDI QIDQ2434738

V. V. Shenmaier

Publication date: 7 February 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2012.09.007

zbMATH Keywords

approximation algorithmpolyhedral space\(m\)-PSPgeometric TSPMAX TSP

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (3)

Efficient PTAS for the maximum traveling salesman problem in a metric space of fixed doubling dimension ⋮ An algorithm for the polyhedral cycle cover problem with constraints on the number and length of cycles ⋮ Safe and secure vehicle routing: a survey on minimization of risk exposure

Cites Work

• The geometric maximum traveling salesman problem
• Lower bounds for symmetricK-peripatetic salesman problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Asymptotically optimal algorithms for geometric MAX TSP and MAX \(m\)-PSP