Finding a minimum weight K-link path in graphs with Monge property and applications

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Alok Aggarwal
Baruch Schieber
Takashi Tokuyama
Published in:
Cover Image
 
· Proceeding
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Pages 189-197
ACM New York, NY, USA ©1993
table of contents ISBN:0-89791-582-8 doi>10.1145/160985.161135
Finding a minimum weight <italic>K</italic>-link path in graphs with Monge property and applications Published by ACM 1993 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 22
· Downloads (cumulative): 346
· Citation Count: 13


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder