473 search results - page 1 / 95 » Computing shortest paths with uncertainty |
JAL
2007
13 years 4 months ago
2007
Abstract. We consider the problem of estimating the length of a shortest path in a DAG whose edge lengths are known only approximately but can be determined exactly at a cost. Init...
4OR
2005
13 years 4 months ago
2005
Many real problems can be modelled as robust shortest path problems on digraphs with interval costs, where intervals represent uncertainty about real costs and a robust path is not...
WADS
2009
Springer
13 years 11 months ago
2009
Springer
We develop algorithms to compute edge sequences, Voronoi diagrams, shortest path maps, the Fréchet distance, and the diameter for a polyhedral surface. Distances on the surface a...
WEA
2005
Springer
13 years 10 months ago
2005
Springer
GLOBECOM
2009
IEEE
13 years 2 months ago
2009
IEEE
Abstract--We consider a set of multicast sources, each multicasting a finite amount of data to its corresponding destinations. The objective is to minimize the time to deliver all ...