Cooperative TSP
From MaRDI portal
Publication:982655
DOI10.1016/j.tcs.2010.04.016zbMath1192.68869OpenAlexW2911437505MaRDI QIDQ982655
Oded Schwartz, Adi Avidor, Amitai Armon
Publication date: 7 July 2010
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.04.016
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The freeze-tag problem: How to wake up a swarm of robots
- On the complexity of approximating TSP with neighborhoods and related problems
- Analysis of Christofides' heuristic: some paths are more difficult than cycles
- Transitions in geometric minimum spanning trees
- The Euclidean traveling salesman problem is NP-complete
- Approximation algorithms for the Geometric Covering Salesman Problem
- Approximation schemes for degree-restricted MST and red-blue separation problems
- Approximating the degree-bounded minimum diameter spanning tree problem
- Analysis of Heuristics for the Freeze-Tag Problem
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- On two geometric problems related to the travelling salesman problem
- On Euclidean Vehicle Routing with Allocation
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- A survey of gossiping and broadcasting in communication networks
- Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
- A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees
- Approximation algorithms for TSP with neighborhoods in the plane
- Low-Degree Spanning Trees of Small Weight
- A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover
- Euclidean bounded-degree spanning tree ratios
- Cooperative TSP
- TSP with neighborhoods of varying size
