Sciweavers

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

23

CCCG
2010

favoriteEmaildiscussreport

158views Computational Geometry» more CCCG 2010»

Constrained k-center and movement to independence

14 years 18 days ago

Constrained k-center and movement to independence

Download www.cs.uwm.edu

We obtain hardness results and approximation algorithms for two related geometric problems involving movement. The first is a constrained variant of the k-center problem, arising from a geometric client-server problem. The second is the problem of moving points towards an independent set.

Adrian Dumitrescu, Minghui Jiang

Real-time Traffic

CCCG 2010 | Computational Geometry | Geometric Client-server Problem | K-center Problem | Related Geometric Problems |

claim paper

Related Content

» Impact of Correlated Mobility on DelayThroughput Performance in Mobile AdHoc Networks

» A Relational Positioning Methodology for Robot Task Specification and Execution

» Realtime gesture recognition using deterministic boosting

Post Info
More Details (n/a)

Added	29 Oct 2010
Updated	29 Oct 2010
Type	Conference
Year	2010
Where	CCCG
Authors	Adrian Dumitrescu, Minghui Jiang

Comments (0)