A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf
.
k-Link Shortest Paths in Weighted Subdivisions
[chapter]
2005
Lecture Notes in Computer Science
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 algorithms that yield a path having O(k) links and weighted length at most (1 + ) times the weighted length of an optimal k-link path, for any fixed > 0. Some of our results make use of a new solution for the 1-link
doi:10.1007/11534273_29
fatcat:37sv2l6qzzaynlwioviugvvah4