### 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 Annual Symposium on Computational Geometry |

Pages | 483-484 |

Number of pages | 2 |

Volume | 2006 |

State | Published - 2006 |

Externally published | Yes |

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

### Fingerprint

### Keywords

- Algorithms
- Experimentation

### ASJC Scopus subject areas

- Software
- Geometry and Topology
- Safety, Risk, Reliability and Quality
- Chemical Health and Safety

### Cite this

*Proceedings of the Annual Symposium on Computational Geometry*(Vol. 2006, pp. 483-484)

**Approximating minimum-cost polygonal paths of bounded number of links in weighted subdivisions.** / Daescu, Ovidiu; Mitchell, Joseph S B; Ntafos, Simeon; Palmer, James D; Yap, Chee K.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Proceedings of the Annual Symposium on Computational Geometry.*vol. 2006, pp. 483-484, 22nd Annual Symposium on Computational Geometry 2006, SCG'06, Sedona, AZ, United States, 6/5/06.

}

TY - GEN

T1 - Approximating minimum-cost polygonal paths of bounded number of links in weighted subdivisions

AU - Daescu, Ovidiu

AU - Mitchell, Joseph S B

AU - Ntafos, Simeon

AU - Palmer, James D

AU - Yap, Chee K.

PY - 2006

Y1 - 2006

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

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

KW - Algorithms

KW - Experimentation

UR - http://www.scopus.com/inward/record.url?scp=33748062983&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33748062983&partnerID=8YFLogxK

M3 - Conference contribution

SN - 1595933409

SN - 9781595933409

VL - 2006

SP - 483

EP - 484

BT - Proceedings of the Annual Symposium on Computational Geometry

ER -