Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

FAW
2010
Springer

favoriteEmaildiscussreport

225views Algorithms» more FAW 2010»

Computing Minimum Diameter Color-Spanning Sets

13 years 4 months ago

Computing Minimum Diameter Color-Spanning Sets

Download www.tcs.fudan.edu.cn

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.

Rudolf Fleischer, Xiaoming Xu

Real-time Traffic

Algorithms | Color-spanning Set | Constant Factor Approximation | FAW 2010 | Minimum Diameter |

claim paper

Related Content

» An Energy Model for Visual Graph Clustering

» Average Case Analysis of Dynamic Geometric Optimization

» Coordinated consensus in dynamic networks

» On the superconnectivity of generalized pcycles

» Design and Implementation of Overlay Multicast Protocol for Multimedia Streaming

» Approximation Algorithms for Hamming Clustering Problems

» The Bidimensional Theory of BoundedGenus Graphs

» Adaptive Sampling for Geometric Problems over Data Streams

» Optimal location of transportation devices

Post Info
More Details (n/a)

Added	06 Dec 2010
Updated	06 Dec 2010
Type	Conference
Year	2010
Where	FAW
Authors	Rudolf Fleischer, Xiaoming Xu

Comments (0)