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
NP-completeness of spreading colored points
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
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
Algorithms for interval structures with applications
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Computing minimum diameter color-spanning sets is hard
Information Processing Letters
Proceedings of the 25th International Conference on Scientific and Statistical Database Management
On some geometric problems of color-spanning sets
Journal of Combinatorial Optimization
Algorithms for interval structures with applications
Theoretical Computer Science
| Hi-index | 0.01 |
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.