Approximation schemes for minimum latency problems

DOI10.1145/301250.301432MaRDI QIDQ2819598zbMATH OpenOpenAlexFDO

Authors George Karakostas, Sanjeev Arora

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

Mathematics Subject Classification ID

Approximation algorithms (68W25) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Approximation Schemes for Minimum Latency Problems
• scientific article; zbMATH DE number 2079325
• An improved approximation ratio for the minimum latency problem
• scientific article; zbMATH DE number 871910
• A Faster, Better Approximation Algorithm for the Minimum Latency Problem
• Polynomial time algorithms for some minimum latency problems
• Two improved formulations for the minimum latency problem
• Reoptimization of Minimum Latency problem
• The minimum latency problem
• Algorithms – ESA 2005

Cited in

(21)

• A new formulation for the traveling deliveryman problem
• News from the online traveling repairman.
• A constant-factor approximation for directed latency in quasi-polynomial time
• The minimum latency problem
• Polynomial time algorithms for some minimum latency problems
• Two improved formulations for the minimum latency problem
• Minimization of the total completion time for asynchronous transmission in a packet data-transmission system
• Approximation Schemes for Minimum Latency Problems
• scientific article; zbMATH DE number 2079396 (Why is no real title available?)
• scientific article; zbMATH DE number 1507215 (Why is no real title available?)
• scientific article; zbMATH DE number 2086925 (Why is no real title available?)
• A note on the traveling repairman problem
• scientific article; zbMATH DE number 871910 (Why is no real title available?)
• The \(k\)-traveling repairmen 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.
• scientific article; zbMATH DE number 6297719 (Why is no real title available?)
• Polynomial Time Approximation Schemes for the Traveling Repairman and Other Minimum Latency Problems
• Minimizing maximum lateness under linear deterioration
• Minimizing latency of capacitated \(k\)-tours
• On the minimum delay problem

This page was built for publication: Approximation schemes for minimum latency problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2819598)