TRAVELING SALESMAN PROBLEM OF SEGMENTS

DOI10.1142/S0218195904001342zbMath1093.90052OpenAlexW2127473933MaRDI QIDQ4818594

Ronald Berezney, Yang Yang, Jinhui Xu, Zhiyong Lin

Publication date: 29 September 2004

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195904001342

zbMATH Keywords

Algorithmtraveling salesman problempolynomial time approximation scheme

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Approximation algorithms for the Geometric Covering Salesman Problem
• Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
• Fast Algorithms for Geometric Traveling Salesman Problems
• Fast Heuristics for Large Geometric Traveling Salesman Problems
• Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
• The Traveling Salesman Problem with Distances One and Two
• A polynomial time approximation scheme for the problem of interconnecting highways

This page was built for publication: TRAVELING SALESMAN PROBLEM OF SEGMENTS