353 search results - page 42 / 71 » Two-phase Algorithms for the Parametric Shortest Path Proble... |
SENSYS
2003
ACM
14 years 1 months ago
2003
ACM
We present a technique for compression of shortest paths routing tables for wireless ad hoc networks. The main characteristic of such networks is that geographic location of nodes...
MST
2010
13 years 7 months ago
2010
Given a graph G we consider the problem of preprocessing it so that given two vertices x,y and a set X of vertices, we can efficiently report the shortest path (or just its length...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
Efficiently computing fast paths in large-scale dynamic road networks (where dynamic traffic information is known over a part of the network) is a practical problem faced by sever...
SIGMOD
2004
ACM
14 years 2 months ago
2004
ACM
Clustering is one of the most important analysis tasks in spatial databases. We study the problem of clustering objects, which lie on edges of a large weighted spatial network. Th...
JAIR
2002
13 years 8 months ago
2002
We consider the problem of designing the the utility functions of the utility-maximizing agents in a multi-agent system (MAS) so that they work synergistically to maximize a globa...