20 search results - page 1 / 4 » Small Approximate Pareto Sets for Bi-objective Shortest Path... |
APPROX
2007
Springer
14 years 1 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...
ISAAC
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We consider bicriteria optimization problems and investigate the relationship between two standard approaches to solving them: (i) computing the Pareto curve and (ii) the...
APPROX
2009
Springer
14 years 2 months ago
2009
Springer
We consider adding k shortcut edges (i.e. edges of small fixed length δ ≥ 0) to a graph so as to minimize the weighted average shortest path distance over all pairs of vertices...
SIAMCOMP
2000
13 years 7 months ago
2000
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...
CDC
2009
IEEE
13 years 5 months ago
2009
IEEE
Abstract-- We consider a wireless system with a small number of delay constrained users and a larger number of users without delay constraints. We develop a scheduling algorithm th...