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

  title={Linear Programming-based Approximation Algorithms for Multi-Vehicle Minimum Latency Problems (Extended Abstract)},
  author={Ian Post and Chaitanya Swamy},
We consider various multi-vehicle versions of the minimum latency problem. There is a fleet of k vehicles located at one or more depot nodes, and we seek a collection of routes for these vehicles that visit all nodes so as to minimize the total latency incurred, which is the sum of the client waiting times. We obtain an 8.497-approximation for the version where vehicles may be located at multiple depots and a 7.183-approximation for the version where all vehicles are located at the same depot… 
Minimizing Latency in Online Ride and Delivery Services
This paper considers point-to-point requests that come with source-destination pairs and release-time constraints that restrict when each request can be served and shows constant-factor approximation algorithms based on a linear programming framework for these variants of the minimum latency problems.
Facility Location with Client Latencies: LP-Based Techniques for Minimum-Latency Problems
We introduce a problem that is a common generalization of the uncapacitated facility location (UFL) and minimum latency (ML) problems, where facilities not only need to be opened to serve clients,
The complexity of some set-partitioning formulations for the capacitated vehicle routing problem with stochastic demands
This thesis shows that when customer demands are given by a finite set of demand scenarios, exactly solving the pricing problem for the CVRPSD is strongly NP-hard, and presents results on the hardness of performing exact pricing for set-partitioning formulations for the BPSD.
Compact, Provably-Good LPs for Orienteering and Regret-Bounded Vehicle Routing
Polynomial-size LP-relaxations for orienteering and the regret-bounded vehicle routing problem (RVRP) are developed and suitable LP-rounding algorithms are devised that lead to various new insights and approximation results for these problems.


Improved approximation algorithms for the minimum latency problem via prize-collecting strolls
This paper improves the approximation ratio for trees to 3.03 and builds improved approximation algorithms for a much wider class of graphs, using an infinite-dimensional linear program used to analyze a finite-dimensional factor-revealing linear program (FRLP).
An improved approximation ratio for the minimum latency problem
The development of the algorithm involves a number of techniques that seem to be of interest from the perspective of the TSP and its variants more generally, and improves the approximation ratio to 21.55.
Approximation schemes for minimum latency problems
A quasi-polynomial time approximation scheme (QPTAS) for this problem when the instance is a weighted tree, when the nodes lie in Rd for some fixed d, and for planar graphs is presented.
Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems
LP-based methods are versatile and easily adapted to yield approximation guarantees for MLUFL in various more general settings, such as (i) when the latency-cost of a client is a function of the delay faced by the facility to which it is connected; and (ii) the k-route version, where k vehicles are routed in parallel to activate the open facilities.
The Minimum Latency Problem Is NP-Hard for Weighted Trees
It is shown that the minimum latency problem is NP-hard for trees even with weights in {0, 1}, and the complexity for the problem where the metric is given by an edge-weighted tree has been a long-standing open problem.
The k-traveling repairmen problem
This work considers the k-traveling repairmen problem to multiple repairmen, and gives a polynomial-time 8.497α-approximation algorithm for this generalization, where α denotes the best achievable approximation factor for the problem of finding the least-cost rooted tree spanning i vertices of a metric.
Polynomial time approximation schemes for the traveling repairman and other minimum latency problems
We give a polynomial time, (1 + e)-approximation algorithm for the traveling repairman problem (TRP) in the Euclidean plane, on weighted planar graphs, and on weighted trees. This improves on the
The traveling salesman problem with cumulative costs
In this paper, we consider a special case of the time-dependent traveling salesman problem where the objective is to minimize the sum of all distances traveled from the origin to all other cities.
The minimum latency problem
A tour that minimizes ∑n i=1 `(i), where `( i) is the latency of pi, defined to be the distance traveled before first visiting pi, is constructed.