Computing minimum diameter color-spanning sets is hard
We show that the minimum diameter color-spanning set problem is NP-hard for L(p) metric, 1 < p < infinity. (C) 2011 Elsevier B.V. All rights reserved.
analysis of algorithms np hardness minimum diameter color-spanning disk