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

Ovidiu Daescu, Joseph S B Mitchell, Simeon Ntafos, James D Palmer, Chee K. Yap

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

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 languageEnglish (US)
Title of host publicationProceedings of the Annual Symposium on Computational Geometry
Pages483-484
Number of pages2
Volume2006
StatePublished - 2006
Externally publishedYes
Event22nd Annual Symposium on Computational Geometry 2006, SCG'06 - Sedona, AZ, United States
Duration: Jun 5 2006Jun 7 2006

Other

Other22nd Annual Symposium on Computational Geometry 2006, SCG'06
CountryUnited States
CitySedona, AZ
Period6/5/066/7/06

Fingerprint

Approximation algorithms
Subdivision
Path
Costs
Shortest path
Approximation Algorithms
Software
Computing

Keywords

  • Algorithms
  • Experimentation

ASJC Scopus subject areas

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

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

Proceedings of the Annual Symposium on Computational Geometry. Vol. 2006 2006. p. 483-484.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Daescu, O, Mitchell, JSB, Ntafos, S, Palmer, JD & Yap, CK 2006, Approximating minimum-cost polygonal paths of bounded number of links in weighted subdivisions. in 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.
Daescu O, Mitchell JSB, Ntafos S, Palmer JD, Yap CK. Approximating minimum-cost polygonal paths of bounded number of links in weighted subdivisions. In Proceedings of the Annual Symposium on Computational Geometry. Vol. 2006. 2006. p. 483-484
Daescu, Ovidiu ; Mitchell, Joseph S B ; Ntafos, Simeon ; Palmer, James D ; Yap, Chee K. / Approximating minimum-cost polygonal paths of bounded number of links in weighted subdivisions. Proceedings of the Annual Symposium on Computational Geometry. Vol. 2006 2006. pp. 483-484
@inproceedings{2e497a443b0748eebfaeb4362f1d1541,
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",
language = "English (US)",
isbn = "1595933409",
volume = "2006",
pages = "483--484",
booktitle = "Proceedings of the Annual Symposium on Computational Geometry",

}

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 -