353 search results - page 9 / 71 » Two-phase Algorithms for the Parametric Shortest Path Proble... |
COMPGEOM
2004
ACM
14 years 28 days ago
2004
ACM
We revisit the problem of computing shortest obstacle-avoiding paths among obstacles in three dimensions. We prove new hardness results, showing, e.g., that computing Euclidean sh...
ACRI
2006
Springer
14 years 1 months ago
2006
Springer
This paper propose a maze routing algorithm based on cellular automata. The aim of this algorithm is find the shortest path between the source cell and the target cell , so that th...
IEEEPACT
2006
IEEE
14 years 1 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...
FOCS
1991
IEEE
13 years 11 months ago
1991
IEEE
The upper bound on the exponent, ω, of matrix multiplication over a ring that was three in 1968 has decreased several times and since 1986 it has been 2.376. On the other hand, t...
WADS
2007
Springer
14 years 1 months ago
2007
Springer
Distance oracles and graph spanners are excerpts of a graph that allow to compute approximate shortest paths. Here, we consider the situation where it is possible to access the ori...