JCM
2007
13 years 4 months ago
2007
—Today, most routing problems are solved using Dijkstra’s shortest path algorithm. Many efficient implementations of Dijkstra’s algorithm exist and can handle large networks ...
JAL
2007
13 years 5 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...
SIGMOD
2008
ACM
13 years 5 months ago
2008
ACM
An algorithm is presented for finding the k nearest neighbors in a spatial network in a best-first manner using network distance. The algorithm is based on precomputing the shorte...
4OR
2005
13 years 5 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...
ORL
2008
13 years 5 months ago
2008
This paper focuses on tractable instances of interval data minmax regret graph problems. More precisely, we provide polynomial and pseudopolynomial algorithms for sets of particul...
EOR
2007
13 years 5 months ago
2007
This paper investigates, for the first time in the literature, the approximation of minmax (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
JPDC
2006
13 years 5 months ago
2006
We focus on data gathering problems in energy constrained networked sensor systems. The system operates in rounds where a subset of the sensors generate a certain number of data p...
JCO
2006
13 years 5 months ago
2006
Reliability is a very important issue in Mobile Ad hoc NETworks (MANETs). Shortest paths are usually used to route packets in MANETs. However, a shortest path may fail quickly, bec...
COMGEO
2006
ACM
13 years 5 months ago
2006
ACM
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We study problems of reconguration of shortest paths in graphs. We prove that the shortest reconguration sequence can be exponential in the size of the graph and that it is NP-hard...