Not all insertion methods yield constant approximate tours in the Euclidean plane
From MaRDI portal
Publication:1318697
DOI10.1016/0304-3975(94)90257-7zbMath0802.90108MaRDI QIDQ1318697
Bala Kalyanasundaram, Vineet Bafna, Kirk R. Pruhs
Publication date: 5 April 1994
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(94)90257-7
90C35: Programming involving graphs or networks
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The relative neighbourhood graph of a finite planar set
- Dynamic Steiner Tree Problem
- An Analysis of Several Heuristics for the Traveling Salesman Problem
- Lower Bounds for Insertion Methods for TSP
- Constructing Reliable Communication Networks of Small Weight Online
- Constructing competitive tours from local information