What goes around comes around: covering tours and cycle covers with turn costs

DOI10.1007/s00224-024-10178-8MaRDI QIDQ6635695

Sándor P. Fekete, Dominik Krupke

Publication date: 12 November 2024

Published in: Theory of Computing Systems (Search for Journal in Brave)

zbMATH Keywords

approximationNP-hardnessgeometric optimizationturn costoptimal cycle coversoptimal tours

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Mathematical programming (90Cxx) Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximation algorithms for lawn mowing and milling
• Covering tours and cycle covers with turn costs: hardness and approximation
• Approximation Algorithms for Curvature-Constrained Shortest Paths
• Experimental Evaluation of Algorithms for the Orthogonal Milling Problem with Turn Costs
• Milling a Graph with Turn Costs: A Parameterized Complexity Perspective
• On Curves of Minimal Length with a Constraint on Average Curvature, and with Prescribed Initial and Terminal Positions and Tangents
• Curvature-Constrained Shortest Paths in a Convex Polygon
• A General Approximation Technique for Constrained Forest Problems
• The Angular-Metric Traveling Salesman Problem
• Practical Methods for Computing Large Covering Tours and Cycle Covers with Turn Cost
• Minimization and maximization versions of the quadratic travelling salesman problem
• The complexity of satisfiability problems
• Optimal Covering Tours with Turn Costs
• Acute tours in the plane
• Near-optimal coverage path planning with turn costs

This page was built for publication: What goes around comes around: covering tours and cycle covers with turn costs