Touring Disjoint Polygons Problem Is NP-Hard

DOI10.1007/978-3-319-03780-6_31zbMath1338.68252OpenAlexW336259651MaRDI QIDQ2867133

Amirhossein Mozafari, Arash Ahadi, Alireza Zarei

Publication date: 10 December 2013

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-03780-6_31

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Minimum cost \(b\)-matching problems with neighborhoods

Cites Work

• Unnamed Item
• Shortest watchman routes in simple polygons
• Touring a sequence of polygons

This page was built for publication: Touring Disjoint Polygons Problem Is NP-Hard