121 search results - page 1 / 25 » Approximation algorithms for the shortest total path length ... |
143
click to vote
DAM
2000
15 years 2 months ago
2000
Given an undirected graph with a nonnegative weight on each edge, the shortest total path length spanning tree problem is to
138
click to vote
ESA
2005
Springer
15 years 7 months ago
2005
Springer
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
128
click to vote
ESA
2004
Springer
15 years 7 months ago
2004
Springer
Let G = (V, E) be an undirected multi-graph with a special vertex root ∈ V , and where each edge e ∈ E is endowed with a length l(e) ≥ 0 and a capacity c(e) > 0. For a pa...
139
click to vote
APPROX
2007
Springer
15 years 8 months ago
2007
Springer
We investigate the problem of computing a minimum set of solutions that approximates within a specified accuracy the Pareto curve of a multiobjective optimization problem. We show...
121
click to vote
APPROX
2009
Springer
15 years 9 months ago
2009
Springer
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...