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]
@inproceedings{ChinGS09,
title = {Minimum Manhattan network is NP-complete},
author = {Francis Y. L. Chin and Zeyu Guo and He Sun},
year = {2009},
doi = {10.1145/1542362.1542429},
url = {http://doi.acm.org/10.1145/1542362.1542429},
tags = {completeness},
researchr = {https://researchr.org/publication/ChinGS09},
cites = {0},
citedby = {0},
pages = {393-402},
booktitle = {Proceedings of the 25th ACM Symposium on Computational Geometry, Aarhus, Denmark, June 8-10, 2009},
editor = {John Hershberger and Efi Fogel},
publisher = {ACM},
isbn = {978-1-60558-501-7},
}