2 papers
cs.DM2025
A Minor-Testing Approach for Coordinated Motion Planning with Sliding Robots
Eduard Eiben, Robert Ganian, Iyad Kanj +1
We study a variant of the Coordinated Motion Planning problem on undirected graphs, referred to herein as the \textsc{Coordinated Sliding-Motion Planning} (CSMP) problem. In this v…
cs.DS2024
Routing on Sparse Graphs with Non-metric Costs for the Prize-collecting Travelling Salesperson Problem
Patrick O'Hara, M. S. Ramanujan, Theodoros Damoulas
In many real-world routing problems, decision makers must optimise over sparse graphs such as transportation networks with non-metric costs on the edges that do not obey the triang…