Sciweavers

96 search results - page 1 / 20
» Fast Exact MultiConstraint Shortest Path Algorithms
Sort
View
ICC
2007
IEEE
13 years 11 months ago
Fast Exact MultiConstraint Shortest Path Algorithms
Yuxi Li, Janelle J. Harms, Robert C. Holte
COR
2004
146views more  COR 2004»
13 years 5 months ago
An exact algorithm for the robust shortest path problem with interval data
The robust deviation shortest path problem with interval data is studied in this paper. After the formulation of the problem in mathematical terms, an exact algorithm, based on a ...
Roberto Montemanni, Luca Maria Gambardella
ICCSA
2004
Springer
13 years 11 months ago
A Robust and Fast Algorithm for Computing Exact and Approximate Shortest Visiting Routes
Abstract. Given a simple n-sided polygon in the plane with a boundary partitioned into subchains some of which are convex and colored, we consider the following problem: Which is t...
Håkan Jonsson
ALENEX
2010
161views Algorithms» more  ALENEX 2010»
13 years 7 months ago
Route Planning with Flexible Objective Functions
We present the first fast route planning algorithm that answers shortest paths queries for a customizable linear combination of two different metrics, e. g. travel time and energy...
Robert Geisberger, Moritz Kobitzsch, Peter Sanders
FCT
1995
Springer
13 years 9 months ago
Fast Algorithms for Maintaining Shortest Paths in Outerplanar and Planar Digraphs
Abstract. We present algorithms for maintaining shortest path information in dynamic outerplanar digraphs with sublogarithmic query time. By choosing appropriate parameters we achi...
Hristo Djidjev, Grammati E. Pantziou, Christos D. ...