268 search results - page 28 / 54 » Finding the k Shortest Paths |
SODA
2004
ACM
13 years 9 months ago
2004
ACM
We consider the problem of picking (buying) an inexpensive s-t path in a graph where edges are owned by independent (selfish) agents, and the cost of an edge is known to its owner...
PRL
2006
13 years 7 months ago
2006
This paper describes an ant colony optimization approach adopted to decide on road-borders to automatically guide a vehicle developed for the DARPA Grand Challenge 2004, available...
CCR
2002
13 years 7 months ago
2002
In Differentiated Service (DiffServ) networks, the routing algorithms used by the premium class traffic, due to the high priority afforded to that traffic, may have a significant ...
ALGORITHMICA
2010
13 years 7 months ago
2010
Abstract We consider a variant of the path cover problem, namely, the k-fixedendpoint path cover problem, or kPC for short, on interval graphs. Given a graph G and a subset T of k ...
ISCC
2009
IEEE
14 years 2 months ago
2009
IEEE
Routing protocols for Wireless Sensor Networks (WSN) face three major performance challenges. The first one is an efficient use of bandwidth that minimizes the transfer delay of p...