Results 1  10
of
1,802,864
The minimum latency problem
 IN PROCEEDINGS OF THE SYMPOSIUM ON THEORY OF COMPUTING
, 1994
"... We are given a set of points pl,...,p. and a symmetric distance matrix (o!ij) giving the distance between pi and pj. We wish to construct a tour that minimizes ~~=1 1(z), where l(i) is ..."
Abstract

Cited by 94 (4 self)
 Add to MetaCart
We are given a set of points pl,...,p. and a symmetric distance matrix (o!ij) giving the distance between pi and pj. We wish to construct a tour that minimizes ~~=1 1(z), where l(i) is
The Directed Minimum Latency Problem
"... We study the directed minimum latency problem: given an nvertex asymmetric metric (V, d) with a root vertex r ∈ V, find a spanning path originating at r that minimizes the sum of latencies at all vertices (the latency of any vertex v ∈ V is the distance from r to v along the path). This problem has ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
We study the directed minimum latency problem: given an nvertex asymmetric metric (V, d) with a root vertex r ∈ V, find a spanning path originating at r that minimizes the sum of latencies at all vertices (the latency of any vertex v ∈ V is the distance from r to v along the path). This problem
Approximation schemes for minimum latency problems
 In Proceedings of the 31st Annual ACM Symposium on the Theory of Computing
, 1999
"... Abstract The minimum latency problem, also known as travelingrepairman problem [1], is a variant of the TSP in which the starting node of the tour is given and the goal isto minimize the sum of the arrival times at the other nodes. We present a quasipolynomialtime approximationscheme for this probl ..."
Abstract

Cited by 32 (3 self)
 Add to MetaCart
Abstract The minimum latency problem, also known as travelingrepairman problem [1], is a variant of the TSP in which the starting node of the tour is given and the goal isto minimize the sum of the arrival times at the other nodes. We present a quasipolynomialtime approximationscheme
A Variation of Minimum Latency Problem
"... In this paper we study the variation of the minimum latency problem(MLP) [2]. The MLP is to find a walk tour on the graph G(V, E) with a distance matrix di,j. Where di,j indicate the distance between vi and vj. Let ℓ(vi) is the latency length of vi, defined to be the distance traveled before first v ..."
Abstract
 Add to MetaCart
In this paper we study the variation of the minimum latency problem(MLP) [2]. The MLP is to find a walk tour on the graph G(V, E) with a distance matrix di,j. Where di,j indicate the distance between vi and vj. Let ℓ(vi) is the latency length of vi, defined to be the distance traveled before first
An Improved Approximation Ratio for the Minimum Latency Problem
 Mathematical Programming
, 1996
"... Given a tour visiting n points in a metric space, the latency of one of these points p is the distance traveled in the tour before reaching p. The minimum latency problem asks for a tour passing through n given points for which the total latency of the n points is minimum; in effect, we are seekin ..."
Abstract

Cited by 87 (2 self)
 Add to MetaCart
Given a tour visiting n points in a metric space, the latency of one of these points p is the distance traveled in the tour before reaching p. The minimum latency problem asks for a tour passing through n given points for which the total latency of the n points is minimum; in effect, we
The minimum latency problem is NPhard for weighted trees
 In Proc. 9th Integer Programming and Combinatorial Optimization Conference
, 2002
"... Abstract. In the minimum latency problem (MLP) we are given n points v1,..., vn and a distance d(vi, vj) between any pair of points. We have to find a tour, starting at v1 and visiting all points, for which the sum of arrival times is minimal. The arrival time at a point vi is the traveled distance ..."
Abstract

Cited by 25 (1 self)
 Add to MetaCart
Abstract. In the minimum latency problem (MLP) we are given n points v1,..., vn and a distance d(vi, vj) between any pair of points. We have to find a tour, starting at v1 and visiting all points, for which the sum of arrival times is minimal. The arrival time at a point vi is the traveled distance
Faster Approximation Algorithms for the Minimum Latency Problem
 In Proceedings of the Fourteenth Annual ACMSIAM Symposium on Discrete Algorithms (SODA), 2003. [BCC + 94
, 2003
"... In this paper, we give a 9.28approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prizecollecting Steiner tree (PCST) subroutine of Goemans and Williamson. A previous algorithm of Goemans and Kleinberg for the minimum latency problem requires an approximat ..."
Abstract

Cited by 17 (2 self)
 Add to MetaCart
In this paper, we give a 9.28approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prizecollecting Steiner tree (PCST) subroutine of Goemans and Williamson. A previous algorithm of Goemans and Kleinberg for the minimum latency problem requires
A New Flow Formulation for the Minimum Latency Problem
"... the Deliveryman Problem and the Traveling Salesman Problem with Cumulative Costs, is a variant of the Traveling Salesman Problem [8] (TSP) in which a repairman is supposed to visit the nodes of a graph in a way to minimize the overall waiting times of the customers located in the nodes of the graph. ..."
Abstract
 Add to MetaCart
the Deliveryman Problem and the Traveling Salesman Problem with Cumulative Costs, is a variant of the Traveling Salesman Problem [8] (TSP) in which a repairman is supposed to visit the nodes of a graph in a way to minimize the overall waiting times of the customers located in the nodes of the graph.
A faster, better approximation algorithm for the minimum latency problem
, 2003
"... Abstract We give a 7.18approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prizecollecting Steiner tree (PCST) subroutine of Goemans and Williamson.This improves the previous best algorithms in both performance guarantee and running time. A previous algor ..."
Abstract

Cited by 14 (3 self)
 Add to MetaCart
Abstract We give a 7.18approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prizecollecting Steiner tree (PCST) subroutine of Goemans and Williamson.This improves the previous best algorithms in both performance guarantee and running time. A previous
Results 1  10
of
1,802,864