Arc-routing for winter road maintenance
Data Structures and Algorithms
2020-11-17 v3 Computational Complexity
Abstract
The arc-routing problems are known to be notoriously hard. We study here a natural arc-routing problem on trees and more generally on bounded tree-width graphs and surprisingly show that it can be solved in a polynomial time. This implies a sub-exponential algorithm for the planar graphs and small number of maintaining cars, which is of practical relevance.
Keywords
Cite
@article{arxiv.2001.08416,
title = {Arc-routing for winter road maintenance},
author = {Jiří Fink and Martin Loebl},
journal= {arXiv preprint arXiv:2001.08416},
year = {2020}
}
Comments
22 pages, no figure