Note: Constrained k-center and movement to independence

Authors:
Adrian Dumitrescu;Minghui Jiang
Affiliations:
Department of Computer Science, University of Wisconsin-Milwaukee, WI 53201-0784, USA;Department of Computer Science, Utah State University, Logan, UT 84322-4205, USA
Venue:
Discrete Applied Mathematics
Year:
2011

Citing 7
Cited 1

Optimal algorithms for approximate clustering

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Approximation algorithms for spreading points

Journal of Algorithms
Minimizing Movement in Mobile Facility Location Problems

FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Minimizing movement

ACM Transactions on Algorithms (TALG)
Systems of distant representatives

Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Universality considerations in VLSI circuits

IEEE Transactions on Computers
Parameterized Complexity of Geometric Problems

The Computer Journal

Systems of distant representatives in euclidean space

Proceedings of the twenty-ninth annual symposium on Computational geometry

Quantified Score

Hi-index	0.05

Visualization

Abstract

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.