WALCOM: Algorithms and Computation
Volume 5431 of the series Lecture Notes in Computer Science pp 59-70
Shortest Gently Descending Paths
- Mustaq AhmedAffiliated withD. R. C. School of Computer Science, University of Waterloo
- , Anna LubiwAffiliated withD. R. C. School of Computer Science, University of Waterloo
- , Anil MaheshwariAffiliated withSchool of Computer Science, Carleton University
Abstract
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. We introduce a generalization of the shortest descending path problem, called the shortest gently descending path (SGDP) problem, where a path descends, but not too steeply. The additional constraint to disallow a very steep descent makes the paths more realistic in practice. We give two approximation algorithms (more precisely, FPTASs) to solve the SGDP problem on general terrains.
- Title
- Shortest Gently Descending Paths
- Book Title
- WALCOM: Algorithms and Computation
- Book Subtitle
- Third International Workshop, WALCOM 2009, Kolkata, India, February 18-20, 2009. Proceedings
- Pages
- pp 59-70
- Copyright
- 2009
- DOI
- 10.1007/978-3-642-00202-1_6
- Print ISBN
- 978-3-642-00201-4
- Online ISBN
- 978-3-642-00202-1
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- 5431
- Series ISSN
- 0302-9743
- Publisher
- Springer Berlin Heidelberg
- Copyright Holder
- Springer-Verlag Berlin Heidelberg
- Additional Links
- Topics
- Industry Sectors
- eBook Packages
- Editors
-
- Sandip Das (16)
- Ryuhei Uehara (17)
- Editor Affiliations
-
- 16. Indian Statistical Institute
- 17. Japan Advanced Institute of Science and Technology
- Authors
-
- Mustaq Ahmed (18)
- Anna Lubiw (18)
- Anil Maheshwari (19)
- Author Affiliations
-
- 18. D. R. C. School of Computer Science, University of Waterloo, ON, Canada
- 19. School of Computer Science, Carleton University, ON, Canada
Continue reading...
To view the rest of this content please follow the download PDF link above.