Sciweavers

3678 search results - page 43 / 736
» On the Stable Paths Problem
Sort
View
HEURISTICS
2002
155views more  HEURISTICS 2002»
13 years 9 months ago
Bounds and Heuristics for the Shortest Capacitated Paths Problem
Given a graph G, the Shortest Capacitated Paths Problem (SCPP) consists of determining a set of paths of least total length, linking given pairs of vertices in G, and satisfying c...
Marie-Christine Costa, Alain Hertz, Michel Mittaz
PPSN
2010
Springer
13 years 7 months ago
More Effective Crossover Operators for the All-Pairs Shortest Path Problem
The all-pairs shortest path problem is the first non-artificial problem for which it was shown that adding crossover can significantly speed up a mutation-only evolutionary algorit...
Benjamin Doerr, Daniel Johannsen, Timo Kötzin...
CLEANDB
2006
ACM
163views Database» more  CLEANDB 2006»
14 years 3 months ago
Circumventing Data Quality Problems Using Multiple Join Paths
We propose the Multiple Join Path (MJP) framework for obtaining high quality information by linking fields across multiple databases, when the underlying databases have poor qual...
Yannis Kotidis, Amélie Marian, Divesh Sriva...
AICT
2006
IEEE
14 years 4 months ago
Optimal Solution of the Maximum All Request Path Grooming Problem
— We give an optimal solution to the Maximum All Request Path Grooming (MARPG) problem motivated by a traffic grooming application. The MARPG problem consists in finding the ma...
Jean-Claude Bermond, Michel Cosnard, David Coudert...
APPROX
2007
Springer
99views Algorithms» more  APPROX 2007»
14 years 4 months ago
Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems
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...
Ilias Diakonikolas, Mihalis Yannakakis