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 9 items.
- A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics (Q650109) (← links)
- Cooperative TSP (Q982655) (← links)
- Online covering salesman problem (Q1743496) (← 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)
- The Shortest Separating Cycle Problem (Q2971152) (← links)
- EXISTENCE AND COMPUTATION OF TOURS THROUGH IMPRECISE POINTS (Q3007721) (← links)
- Constant-Factor Approximation for TSP with Disks (Q4604382) (← links)
- Observation routes and external watchman routes (Q6633574) (← links)
