Minimum Manhattan network is NP-complete - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Francis Y. L. Chin, Zeyu Guo, He Sun. Minimum Manhattan network is NP-complete. In John Hershberger, Efi Fogel, editors, Proceedings of the 25th ACM Symposium on Computational Geometry, Aarhus, Denmark, June 8-10, 2009. pages 393-402, ACM, 2009. [doi]

This author has not been identified. Look up 'Francis Y. L. Chin' in GoogleThis author has not been identified. Look up 'Zeyu Guo' in GoogleThis author has not been identified. Look up 'He Sun' in Google

runs on WebDSL