Linear and O(n log n) time minimum-cost matching algorithms for quasi-convex tours

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Samuel R. Buss Department of Mathematics, University of California, San Diego, La Jolla, CA
Peter N. Yianilos NEC Research Institute, 4 Independence Way, Princeton, NJ
Published in:
· Proceeding
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Pages 65-76
Society for Industrial and Applied Mathematics Philadelphia, PA, USA ©1994
table of contents ISBN:0-89871-329-3
Linear and <italic>O</italic>(<italic>n</italic> log <italic>n</italic>) time minimum-cost matching algorithms for quasi-convex tours 1994 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 7
· Downloads (cumulative): 291
· Citation Count: 2


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