2010 | OriginalPaper | Chapter
Computing Minimum Diameter Color-Spanning Sets
Authors : Rudolf Fleischer, Xiaoming Xu
Published in: Frontiers in Algorithmics
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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
L
1
and
L
∞
metrics, while it is NP-hard for all other
L
p
metrics even in two dimensions. However, we can efficiently compute a constant factor approximation.