Linear Programming-based Approximation Algorithms for Multi-Vehicle Minimum Latency Problems (Extended Abstract)

DOI10.1137/1.9781611973730.35zbMath1371.90027arXiv1411.4573OpenAlexW4230141264MaRDI QIDQ5362984

Chaitanya Swamy, Ian Post

Publication date: 5 October 2017

Published in: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1411.4573

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05) Transportation, logistics and supply chain management (90B06)

Related Items (6)

A constant-factor approximation for directed latency in quasi-polynomial time ⋮ Combinatorial algorithms for rooted prize-collecting walks and applications to orienteering and minimum-latency problems ⋮ Approximate minimum sum colorings and maximum \(k\)-colorable subgraphs of chordal graphs ⋮ A Constant-Factor Approximation for Directed Latency in Quasi-Polynomial Time ⋮ Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems ⋮ Minimizing latency of capacitated \(k\)-tours

This page was built for publication: Linear Programming-based Approximation Algorithms for Multi-Vehicle Minimum Latency Problems (Extended Abstract)