@inproceedings{37f9d2fd91624a26bfd4f73b0175d2d2,

title = "Approximating minimum-cost polygonal paths of bounded number of links in weighted subdivisions",

abstract = "This video illustrates the k-LinkSolver software for computing k-link shortest paths in weighted regions. The k-LinkSolver implements methods to find paths of length at most (1 + ε) times the length of a shortest k-link path, for any fixed ε > 0, and having at most 2k - 1 links. The methods implemented are an improvement over the previously known (1 + ε)-approximation algorithms, which guarantee at most 5k - 2 links.",

keywords = "Algorithms, Experimentation",

author = "Ovidiu Daescu and Mitchell, {Joseph S B} and Simeon Ntafos and Palmer, {James D.} and Yap, {Chee K.}",

year = "2006",

doi = "10.1145/1137856.1137930",

language = "English (US)",

isbn = "1595933409",

series = "Proceedings of the Annual Symposium on Computational Geometry",

publisher = "Association for Computing Machinery (ACM)",

pages = "483--484",

booktitle = "Proceedings of the Twenty-Second Annual Symposium on Computational Geometry 2006, SCG'06",

address = "United States",

note = "22nd Annual Symposium on Computational Geometry 2006, SCG'06 ; Conference date: 05-06-2006 Through 07-06-2006",

}