On Approximating the TSP with Intersecting Neighborhoods

DOI10.1007/11940128_23zbMATH Open1135.90387OpenAlexW1544478599MaRDI QIDQ5459117

Khaled M. Elbassioni, R. A. Sitters, Aleksei V. Fishkin

Publication date: 24 April 2008

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11940128_23

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (3)

Unnamed Item ⋮ A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics ⋮ TSP with neighborhoods of varying size

This page was built for publication: On Approximating the TSP with Intersecting Neighborhoods