Pages that link to "Item:Q2768270"
From MaRDI portal
The following pages link to Approximation algorithms for TSP with neighborhoods in the plane (Q2768270):
Displaying 20 items.
- A joint optimization of data ferry trajectories and communication powers of ground sensors for long-term environmental monitoring (Q281797) (← links)
- On the complexity of approximating TSP with neighborhoods and related problems (Q853644) (← links)
- Approximation algorithms for the Geometric Covering Salesman Problem (Q1343140) (← links)
- Approximation schemes for the generalized traveling salesman problem (Q1744982) (← links)
- New approximation results for the maximum scatter TSP (Q1774146) (← links)
- Approximation algorithms for lawn mowing and milling (Q1841242) (← links)
- Building bridges between convex regions (Q1873160) (← links)
- Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters (Q2294592) (← links)
- Shortest paths in simple polygons with polygon-meet constraints (Q2390305) (← links)
- Connectivity graphs of uncertainty regions (Q2408099) (← links)
- Query-point visibility constrained shortest paths in simple polygons (Q2465622) (← links)
- Approximation Algorithms for Generalized MST and TSP in Grid Clusters (Q3467839) (← links)
- Visiting a Polygon on the Optimal Way to a Query Point (Q3507339) (← links)
- TSP with locational uncertainty: the adversarial model (Q4580107) (← links)
- Constant-Factor Approximation for TSP with Disks (Q4604382) (← links)
- The travelling salesman problem with neighbourhoods: MINLP solution (Q4924121) (← links)
- A PTAS for Euclidean TSP with Hyperplane Neighborhoods (Q4987459) (← links)
- TSP with neighborhoods of varying size (Q5704854) (← links)
- Automata, Languages and Programming (Q5716858) (← links)
- Algorithms - ESA 2003 (Q5897267) (← links)
