Pages that link to "Item:Q853644"
From MaRDI portal
The following pages link to On the complexity of approximating TSP with neighborhoods and related problems (Q853644):
Displaying 18 items.
- On the \({\mathcal {H}}\)-free extension complexity of the TSP (Q519756) (← links)
- A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics (Q650109) (← links)
- Cooperative TSP (Q982655) (← links)
- Approximation algorithms for the Geometric Covering Salesman Problem (Q1343140) (← links)
- Online covering salesman problem (Q1743496) (← links)
- Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters (Q2294592) (← links)
- Two-level rectilinear Steiner trees (Q2362106) (← links)
- On the complexity of the selective graph coloring problem in some special classes of graphs (Q2453167) (← links)
- Approximation algorithms for TSP with neighborhoods in the plane (Q2768270) (← links)
- The Shortest Separating Cycle Problem (Q2971152) (← links)
- EXISTENCE AND COMPUTATION OF TOURS THROUGH IMPRECISE POINTS (Q3007721) (← links)
- (Q3079180) (← links)
- Approximate Mechanisms for the Graphical TSP and Other Graph-Traversal Problems (Q3574304) (← links)
- Constant-Factor Approximation for TSP with Disks (Q4604382) (← links)
- The Angular-Metric Traveling Salesman Problem (Q4943841) (← links)
- TSP with neighborhoods of varying size (Q5704854) (← links)
- Algorithms - ESA 2003 (Q5897267) (← links)
- Observation routes and external watchman routes (Q6633574) (← links)
