Francis Y. L. Chin, Zeyu Guo, He Sun. Minimum Manhattan Network is NP-Complete. Discrete & Computational Geometry, 45(4):701-722, 2011. [doi]
@article{ChinGS11,
title = {Minimum Manhattan Network is NP-Complete},
author = {Francis Y. L. Chin and Zeyu Guo and He Sun},
year = {2011},
doi = {10.1007/s00454-011-9342-z},
url = {http://dx.doi.org/10.1007/s00454-011-9342-z},
tags = {completeness},
researchr = {https://researchr.org/publication/ChinGS11},
cites = {0},
citedby = {0},
journal = {Discrete & Computational Geometry},
volume = {45},
number = {4},
pages = {701-722},
}