364 search results - page 19 / 73 » Shortest-path network interdiction |
IPSN
2005
Springer
14 years 1 months ago
2005
Springer
: This paper addresses the problem of maximizing the service lifetime of a distributed battery-powered sensor network in the context of the network interdiction problem under user-...
CCR
1998
13 years 7 months ago
1998
: Multicasting has an increasing importance for network applications such as groupware or videoconferencing. Several multicast routing protocols have been defined. However they can...
OTM
2010
Springer
13 years 5 months ago
2010
Springer
The GRASIM (Graph-Aided Similarity calculation) algorithm is designed to solve the problem of ontology-based data matching. We subdivide the matching problem into the ones of restr...
WEA
2010
Springer
14 years 2 months ago
2010
Springer
We study the problem of finding good alternative routes in road networks. We look for routes that are substantially different from the shortest path, have small stretch, and are ...
JCM
2007
13 years 7 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 ...