Results 1  10
of
2,755
klink shortest paths in weighted subdivisions
 In Proceedings of the 9th International Workshop on Algorithms and Data Structures
, 2005
"... Abstract. 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 path. We prove structural properties of optimal paths and utilize these results to obtain approximation algorith ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
algorithms that yield a path having O(k) links and weighted length at most (1 + ɛ) times the weighted length of an optimal klink path, for any fixed ɛ> 0. Some of our results make use of a new solution for the 1link case, based on computing optimal solutions for a special sumoffractionals (SOF
Finding the k Shortest Paths
, 1997
"... We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our algorithms output an implicit representation of these paths in a digraph with n vertices and m edges, in time O(m + n log n + k). We can also find the k shortest pat ..."
Abstract

Cited by 401 (2 self)
 Add to MetaCart
We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our algorithms output an implicit representation of these paths in a digraph with n vertices and m edges, in time O(m + n log n + k). We can also find the k shortest
Theoretical improvements in algorithmic efficiency for network flow problems

, 1972
"... This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem, and the general minimumcost flow problem. Upper bounds on ... the numbers of steps in these algorithms are derived, and are shown to compale favorably with upper bounds on the numbers of steps req ..."
Abstract

Cited by 560 (0 self)
 Add to MetaCart
problem, in which all shortestpath computations are performed on networks with all weights nonnegative. In particular, this
An Experimental Study of Weighted kLink Shortest Path Algorithms
"... plane is a decomposition of the plane into polygonal regions, with each region having an associated nonnegative weight. In a weighted subdivision the distance between two points a and b within the same region Ri ∈ R ..."
Abstract
 Add to MetaCart
plane is a decomposition of the plane into polygonal regions, with each region having an associated nonnegative weight. In a weighted subdivision the distance between two points a and b within the same region Ri ∈ R
kLink Rectilinear Shortest Paths Among Rectilinear Obstacles in the Plane
"... We present an algorithm for computing klink rectilinear shortest paths among rectilinear obstacles in the plane. We extend the “continuous Dijkstra ” paradigm to store the link distance information associated with each propagating “wavefront”. Our algorithm runs in time O(kn log 2 n) and space O(kn ..."
Abstract
 Add to MetaCart
We present an algorithm for computing klink rectilinear shortest paths among rectilinear obstacles in the plane. We extend the “continuous Dijkstra ” paradigm to store the link distance information associated with each propagating “wavefront”. Our algorithm runs in time O(kn log 2 n) and space O
Computing Geodesic Paths on Manifolds
 Proc. Natl. Acad. Sci. USA
, 1998
"... The Fast Marching Method [8] is a numerical algorithm for solving the Eikonal equation on a rectangular orthogonal mesh in O(M log M) steps, where M is the total number of grid points. In this paper we extend the Fast Marching Method to triangulated domains with the same computational complexity. A ..."
Abstract

Cited by 294 (28 self)
 Add to MetaCart
. As an application, we provide an optimal time algorithm for computing the geodesic distances and thereby extracting shortest paths on triangulated manifolds. 1 Introduction Sethian`s Fast Marching Method [8], is a numerical algorithm for solving the Eikonal equation on a rectangular orthogonal mesh in O(M log M
Geometric Shortest Paths and Network Optimization
 Handbook of Computational Geometry
, 1998
"... Introduction A natural and wellstudied problem in algorithmic graph theory and network optimization is that of computing a "shortest path" between two nodes, s and t, in a graph whose edges have "weights" associated with them, and we consider the "length" of a path to ..."
Abstract

Cited by 187 (15 self)
 Add to MetaCart
Introduction A natural and wellstudied problem in algorithmic graph theory and network optimization is that of computing a "shortest path" between two nodes, s and t, in a graph whose edges have "weights" associated with them, and we consider the "length" of a path
Shortest Paths Algorithms: Theory And Experimental Evaluation
 Mathematical Programming
, 1993
"... . We conduct an extensive computational study of shortest paths algorithms, including some very recent algorithms. We also suggest new algorithms motivated by the experimental results and prove interesting theoretical results suggested by the experimental data. Our computational study is based on se ..."
Abstract

Cited by 188 (15 self)
 Add to MetaCart
. We conduct an extensive computational study of shortest paths algorithms, including some very recent algorithms. We also suggest new algorithms motivated by the experimental results and prove interesting theoretical results suggested by the experimental data. Our computational study is based
An Optimal Algorithm for Euclidean Shortest Paths in the Plane
 SIAM J. Comput
, 1997
"... We propose an optimaltime algorithm for a classical problem in plane computational geometry: computing a shortest path between two points in the presence of polygonal obstacles. Our algorithm runs in worstcase time O(n log n) and requires O(n log n) space, where n is the total number of vertice ..."
Abstract

Cited by 114 (2 self)
 Add to MetaCart
We propose an optimaltime algorithm for a classical problem in plane computational geometry: computing a shortest path between two points in the presence of polygonal obstacles. Our algorithm runs in worstcase time O(n log n) and requires O(n log n) space, where n is the total number
Euclidean Shortest Paths in a Simple Polygon
"... Let p and q be two points in a simple polygon Π. This chapter provides two rubberband algorithms for computing a shortest path between p and q that is contained in Π. The two algorithms use previously known results on triangular or trapezoidal decompositions of simple polygons, and have eitherO (n) ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Let p and q be two points in a simple polygon Π. This chapter provides two rubberband algorithms for computing a shortest path between p and q that is contained in Π. The two algorithms use previously known results on triangular or trapezoidal decompositions of simple polygons, and have eitherO (n
Results 1  10
of
2,755