Cooperative TSP
type: Item
instance of: scholarly article
title: Cooperative TSP
zbMATH Open document ID: 1192.68869
author: Amitai Armon
author: Adi Avidor
author: Oded Schwartz
published in: Theoretical Computer Science
publication date: 2010-07-07T00:00:00Z
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 5731732
zbMATH Keywords: algorithms
zbMATH Keywords: approximation algorithms
zbMATH Keywords: TSP
zbMATH Keywords: cooperative TSP
MaRDI profile type: Publication
full work available at URL: j.tcs.2010.04.016
OpenAlex ID: W2911437505
cites work: Approximation algorithms for the Geometric Covering Salesman Problem
cites work: The freeze-tag problem: How to wake up a swarm of robots
cites work: Cooperative TSP
cites work: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
cites work: Approximation schemes for degree-restricted MST and red-blue separation problems
cites work: Q4542563
cites work: Euclidean bounded-degree spanning tree ratios
cites work: Introduction to algorithms
cites work: TSP with neighborhoods of varying size
cites work: Q4947407
cites work: A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover
cites work: Approximation algorithms for TSP with neighborhoods in the plane
cites work: Q4535019
cites work: A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees
cites work: Q4155835
cites work: Q4948735
cites work: A survey of gossiping and broadcasting in communication networks
cites work: Analysis of Christofides' heuristic: some paths are more difficult than cycles
cites work: Low-Degree Spanning Trees of Small Weight
cites work: Approximating the degree-bounded minimum diameter spanning tree problem
cites work: Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
cites work: Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
cites work: Q2934576
cites work: Transitions in geometric minimum spanning trees
cites work: The Euclidean traveling salesman problem is NP-complete
cites work: On two geometric problems related to the travelling salesman problem
cites work: On Euclidean Vehicle Routing with Allocation
cites work: Q4952699
cites work: On the complexity of approximating TSP with neighborhoods and related problems
cites work: Analysis of Heuristics for the Freeze-Tag Problem
DOI: 10.1016/J.TCS.2010.04.016
description: scientific article; zbMATH DE number 5731732