Minimum Manhattan Network is NP-Complete

15Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Given a set T of n points in ℝ2, a Manhattan network on T is a graph G with the property that for each pair of points in T, G contains a rectilinear path between them of length equal to their distance in the L1-metric. The minimum Manhattan network problem is to find a Manhattan network of minimum length, i. e., minimizing the total length of the line segments in the network. In this paper, we prove that the decision version of the MMN problem is strongly NP-complete, using a reduction from the well-known 3-SAT problem, which requires a number of gadgets. The gadgets have similar structures, but play different roles in simulating a 3-CNF formula. © 2011 The Author(s).

Cite

CITATION STYLE

APA

Chin, F. Y. L., Guo, Z., & Sun, H. (2011). Minimum Manhattan Network is NP-Complete. Discrete and Computational Geometry, 45(4), 701–722. https://doi.org/10.1007/s00454-011-9342-z

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free