552 search results - page 21 / 111 » Constrained Shortest Path Computation |
125
Voted
ACSC
2007
IEEE
15 years 10 months ago
2007
IEEE
This paper presents new algorithms for computing single source shortest paths (SSSPs) in a nearly acyclic directed graph G. The first part introduces higher-order decomposition. ...
138
Voted
MICS
2008
15 years 3 months ago
2008
Multi-level overlay graphs represent a speed-up technique for shortest paths computation which is based on a hierarchical decomposition of a weighted directed graph G. They have b...
138
click to vote
FOCS
1994
IEEE
15 years 7 months ago
1994
IEEE
We describe algorithms for finding the k shortest paths connecting a given pair of vertices in a digraph (allowing cycles). Our algorithms output an implicit representation of the...
181
click to vote
PPSN
2010
Springer
15 years 1 months ago
2010
Springer
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...
131
click to vote
IEEEPACT
2006
IEEE
15 years 10 months ago
2006
IEEE
A recent trend in computing are domain-specific program generators, designed to alleviate the effort of porting and reoptimizing libraries for fast-changing and increasingly com...