Minimum Manhattan network is NP-complete

Full Text: PdfPdf Buy this ArticleBuy this Article
Authors: Francis Y.L. Chin The University of Hong Kong, Hong Kong, China
Zeyu Guo Fudan University, Shanghai, China
He Sun Fudan University, Shanghai, China
Published in:
Cover Image
 
· Proceeding
SCG '09 Proceedings of the 25th annual symposium on Computational geometry
Pages 393-402
ACM New York, NY, USA ©2009
table of contents ISBN: 978-1-60558-501-7 doi>10.1145/1542362.1542429
Minimum Manhattan network is NP-complete Published by ACM 2009 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 5
· Downloads (12 Months): 44
· Downloads (cumulative): 746
· Citation Count: 1


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