Pages that link to "Item:Q4507360"
From MaRDI portal
The following pages link to When Hamming Meets Euclid: The Approximability of Geometric TSP and Steiner Tree (Q4507360):
Displaying 9 items.
- Faster algorithms for orienteering and \(k\)-TSP (Q2124233) (← links)
- Approximate Euclidean Steiner trees (Q2397467) (← links)
- TSP with bounded metrics (Q2495398) (← links)
- The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme (Q2817793) (← links)
- New Approximation Algorithms for (1,2)-TSP (Q5002675) (← links)
- Optimizing Read Reversals for Sequence Compression (Q5283828) (← links)
- Travelling on graphs with small highway dimension (Q5925522) (← links)
- A Modern View on Stability of Approximation (Q6163638) (← links)
- Scheduling on a graph with release times (Q6204662) (← links)