Computing Minimum Diameter Color-Spanning Sets

Abstract

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. 
DOI: 10.1007/978-3-642-14553-7_27

4 Figures and Tables

Topics

  • Presentations referencing similar topics