Minimum weight triangulation is NP-hard

Full Text: PdfPdf Buy this ArticleBuy this Article
Published in:
Cover Image
 
· Proceeding
SCG '06 Proceedings of the twenty-second annual symposium on Computational geometry
Pages 1 - 10
ACM New York, NY, USA ©2006
table of contents ISBN:1-59593-340-9 doi>10.1145/1137856.1137859
Minimum weight triangulation is NP-hard Published by ACM 2006 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 21
· Downloads (cumulative): 455
· Citation Count: 20


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