Computing Minimum Diameter Color-Spanning Sets

We study the minimum diameter color-spanning set problem which has recently drawn some attention in the database community. We show that the problem can be solved in polynomial time for L1 and L metrics, while it is NP-hard for all other Lp metrics even in two dimensions. However, we can efficiently compute a constant factor approximation.

• Type: Conference
• Year: 2010
• Where: FAW
• Authors: Rudolf Fleischer, Xiaoming Xu
• Keywords: Algorithms, Color-spanning Set, Constant Factor Approximation, FAW 2010, Minimum Diameter