410 search results - page 16 / 82 » Upgrading Shortest Paths in Networks |
121
click to vote
JDA
2006
15 years 1 months ago
2006
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...
103
click to vote
ALENEX
2010
15 years 2 months ago
2010
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...
105
click to vote
TEC
2002
15 years 1 months ago
2002
This paper presents a genetic algorithmic approach to the shortest path (SP) routing problem. Variable-length chromosomes (strings) and their genes (parameters) have been used for ...
107
click to vote
IWCMC
2009
ACM
15 years 8 months ago
2009
ACM
This paper addresses the additional energy consumption in wireless sensor networks where the communication between the sensor nodes and the sink nodes does not always make use of ...
107
click to vote
ENTCS
2007
15 years 1 months ago
2007
In this paper, we survey algorithms for shortest paths in dynamic networks. Although research on this problem spans over more than three decades, in the last couple of years many ...