Results 1  10
of
114,668
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 93 (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 5 (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
Minimum Latency Submodular Cover∗
, 2013
"... We study the Minimum Latency Submodular Cover problem (MLSC), which consists of a metric (V, d) with source r ∈ V and m monotone submodular functions f1, f2,..., fm: 2V → [0, 1]. The goal is to find a path originating at r that minimizes the total cover time of all functions. This generalizes wells ..."
Abstract
 Add to MetaCart
We study the Minimum Latency Submodular Cover problem (MLSC), which consists of a metric (V, d) with source r ∈ V and m monotone submodular functions f1, f2,..., fm: 2V → [0, 1]. The goal is to find a path originating at r that minimizes the total cover time of all functions. This generalizes well
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 31 (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
Paths, trees and minimum latency tours
 Proc. of FOCS
, 2003
"... We give improved approximation algorithms for a variety of latency minimization problems. In particular, we give a 3.59 1approximation to the minimum latency problem, improving on previous algorithms by a multiplicative factor of 2. Our techniques also give similar improvements for related problems ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
We give improved approximation algorithms for a variety of latency minimization problems. In particular, we give a 3.59 1approximation to the minimum latency problem, improving on previous algorithms by a multiplicative factor of 2. Our techniques also give similar improvements for related
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 88 (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 24 (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
Results 1  10
of
114,668