Pages that link to "Item:Q3544249"
From MaRDI portal
The following pages link to Combinatorial Optimization with Explicit Delineation of the Ground Set by a Collection of Subsets (Q3544249):
Displayed 8 items.
- A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics (Q650109) (← links)
- Approximation schemes for the generalized traveling salesman problem (Q1744982) (← links)
- Minimum color spanning circle of imprecise points (Q2166769) (← links)
- Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters (Q2294592) (← links)
- Minimum color spanning circle in imprecise setup (Q2695293) (← links)
- Constant-Factor Approximation for TSP with Disks (Q4604382) (← links)
- Fixed set search applied to the clique partitioning problem (Q6112737) (← links)
- Observation routes and external watchman routes (Q6179428) (← links)