Polynomial time approximation schemes for the traveling repairman and other minimum latency problems.
From MaRDI portal
Publication:5384007
DOI10.1137/1.9781611973402.46zbMath1422.68314arXiv1307.4289OpenAlexW2952500164MaRDI QIDQ5384007
Publication date: 20 June 2019
Published in: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1307.4289
Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Related Items (10)
Routing Under Uncertainty: The a priori Traveling Repairman Problem ⋮ Approximation and complexity of multi-target graph search and the Canadian traveler problem ⋮ A \((2 + \epsilon)\)-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective ⋮ The multi-vehicle cumulative covering tour problem ⋮ Approximation Algorithms for Generalized Path Scheduling ⋮ The Chinese deliveryman problem ⋮ The A priori traveling repairman problem ⋮ An Improved Online Algorithm for the Traveling Repairperson Problem on a Line ⋮ A polynomial-time approximation scheme for the airplane refueling problem ⋮ Polynomial Time Approximation Schemes for the Traveling Repairman and Other Minimum Latency Problems
This page was built for publication: Polynomial time approximation schemes for the traveling repairman and other minimum latency problems.
