706 search results - page 7 / 142 » Efficient Algorithms for k -Disjoint Paths Problems on DAGs |
MOBIHOC
2004
ACM
14 years 7 months ago
2004
ACM
We propose several novel localized algorithms to construct energy efficient routing structures for homogeneous wireless ad hoc networks, where all nodes have same maximum transmis...
ICDE
2006
IEEE
14 years 9 months ago
2006
IEEE
A k-NN query finds the k nearest-neighbors of a given point from a point database. When it is sufficient to measure object distance using the Euclidian distance, the key to effici...
FAW
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We study a constrained version of the shortest path problem in polygonal domains, in which the path must visit a given target polygon. We provide an efficient algorithm f...
IPPS
2003
IEEE
14 years 24 days ago
2003
IEEE
— We consider the problem of maintaining routing paths between nodes in a dynamic network. Gafni and Bertsekas proposed a link reversal approach called the BG method that maintai...
PVLDB
2008
13 years 7 months ago
2008
The class of k Nearest Neighbor (kNN) queries is frequently used in geospatial applications. Many studies focus on processing kNN in Euclidean and road network spaces. Meanwhile, ...