Computing minimum diameter color-spanning sets is hard

Authors:
Rudolf Fleischer;Xiaoming Xu
Affiliations:
School of Computer Science and IIPL, Fudan University, Shanghai, China;Department of Computer Science, Duke University, Durham, USA
Venue:
Information Processing Letters
Year:
2011

Smallest Color-Spanning Objects

ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
MarcoPolo: a community system for sharing and integrating travel information on maps

Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Keyword Search in Spatial Databases: Towards Searching by Document

ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Computing minimum diameter color-spanning sets

FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
On some geometric problems of color-spanning sets

FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management

Nearest group queries

Proceedings of the 25th International Conference on Scientific and Statistical Database Management

Hi-index	0.89

We show that the minimum diameter color-spanning set problem is NP-hard for L"p metric, 1