83 search results - page 5 / 17 » On Bounded Leg Shortest Paths Problems |
SPAA
2004
ACM
14 years 1 months ago
2004
ACM
We present the Buffer Heap (BH), a cache-oblivious priority queue that supports Delete-Min, Delete, and Decrease-Key operations in O( 1 B log2 N B ) amortized block transfers fro...
TON
2002
13 years 7 months ago
2002
In this paper we introduce and investigate a new" path optimization problem which we denote as the All Hops Optimal Path AHOP problem. The problem involves identifying, for a...
WADS
2005
Springer
14 years 1 months ago
2005
Springer
We study the shortest path problem in weighted polygonal subdivisions of the plane, with the additional constraint of an upper bound, k, on the number of links (segments) in the pa...
ESA
2005
Springer
14 years 1 months ago
2005
Springer
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
WALCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
We present two space-efficient algorithms. First, we show how to report a simple path between two arbitrary nodes in a given tree. Using a technique called “computing instead of ...