Approximation schemes for minimum latency problems
From MaRDI portal
Publication:2819598
DOI10.1145/301250.301432zbMath1345.90110OpenAlexW2011595401MaRDI QIDQ2819598
Sanjeev Arora, George Karakostas
Publication date: 29 September 2016
Published in: Proceedings of the thirty-first annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/301250.301432
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Related Items (5)
Polynomial time algorithms for some minimum latency problems ⋮ News from the online traveling repairman. ⋮ A new formulation for the traveling deliveryman problem ⋮ An efficient two-phase metaheuristic algorithm for the time dependent traveling Salesman problem ⋮ Polynomial Time Approximation Schemes for the Traveling Repairman and Other Minimum Latency Problems
This page was built for publication: Approximation schemes for minimum latency problems
