### 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.

Original language | English (US) |
---|---|

Title of host publication | Proceedings of the Twenty-Second Annual Symposium on Computational Geometry 2006, SCG'06 |

Publisher | Association for Computing Machinery (ACM) |

Pages | 483-484 |

Number of pages | 2 |

ISBN (Print) | 1595933409, 9781595933409 |

DOIs | |

State | Published - Jan 1 2006 |

Event | 22nd Annual Symposium on Computational Geometry 2006, SCG'06 - Sedona, AZ, United States Duration: Jun 5 2006 → Jun 7 2006 |

### Publication series

Name | Proceedings of the Annual Symposium on Computational Geometry |
---|---|

Volume | 2006 |

### Other

Other | 22nd Annual Symposium on Computational Geometry 2006, SCG'06 |
---|---|

Country | United States |

City | Sedona, AZ |

Period | 6/5/06 → 6/7/06 |

### Keywords

- Algorithms
- Experimentation

### ASJC Scopus subject areas

- Theoretical Computer Science
- Geometry and Topology
- Computational Mathematics

## Fingerprint Dive into the research topics of 'Approximating minimum-cost polygonal paths of bounded number of links in weighted subdivisions'. Together they form a unique fingerprint.

## Cite this

Daescu, O., Mitchell, J. S. B., Ntafos, S., Palmer, J. D., & Yap, C. K. (2006). Approximating minimum-cost polygonal paths of bounded number of links in weighted subdivisions. In

*Proceedings of the Twenty-Second Annual Symposium on Computational Geometry 2006, SCG'06*(pp. 483-484). (Proceedings of the Annual Symposium on Computational Geometry; Vol. 2006). Association for Computing Machinery (ACM). https://doi.org/10.1145/1137856.1137930