The Euclidean degree-4 minimum spanning tree problem is NP-hard

Full Text: PdfPdf Buy this ArticleBuy this Article
Authors: Andrea Francke ETH Zürich, Zürich, Switzerland
Michael Hoffmann ETH Zürich, Zürich, Switzerland
Published in:
Cover Image
 
· Proceeding
SCG '09 Proceedings of the 25th annual symposium on Computational geometry
Pages 179-188
ACM New York, NY, USA ©2009
table of contents ISBN: 978-1-60558-501-7 doi>10.1145/1542362.1542399
The Euclidean degree-4 minimum spanning tree problem is NP-hard Published by ACM 2009 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 45
· Downloads (cumulative): 249
· Citation Count: 3


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