The following pages link to Algorithms - ESA 2003 (Q5897267):
Displaying 15 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)
- On the minimum corridor connection problem and other generalized geometric problems (Q833722) (← links)
- Largest and smallest convex hulls for imprecise points (Q848964) (← links)
- On the complexity of approximating TSP with neighborhoods and related problems (Q853644) (← links)
- Complexity of the minimum-length corridor problem (Q876503) (← links)
- Approximation algorithms for the Geometric Covering Salesman Problem (Q1343140) (← links)
- Approximation results for kinetic variants of TSP (Q1611067) (← links)
- Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters (Q2294592) (← links)
- Approximation algorithms for TSP with neighborhoods in the plane (Q2768270) (← links)
- A decomposition approach for optimal control problems with integer innerpoint state constraints (Q2954906) (← links)
- (Q3079180) (← links)
- Approximation Algorithms for Generalized MST and TSP in Grid Clusters (Q3467839) (← links)
- Approximate Mechanisms for the Graphical TSP and Other Graph-Traversal Problems (Q3574304) (← links)
- TSP with neighborhoods of varying size (Q5704854) (← links)
