O(1)-approximations for maximum movement problems
Author(s)
Berman, Piotr; Demaine, Erik D.; Zadimoghaddam, Morteza
DownloadDemaine-0(1) approximations.pdf (276.2Kb)
OPEN_ACCESS_POLICY
Open Access Policy
Creative Commons Attribution-Noncommercial-Share Alike
Terms of use
Metadata
Show full item recordAbstract
We develop constant-factor approximation algorithms for minimizing the maximum movement made by pebbles on a graph to reach a configuration in which the pebbles form a connected subgraph (connectivity), or interconnect a constant number of stationary nodes (Steiner tree). These problems model the minimization of the total time required to reconfigure a robot swarm to achieve a proximity (e.g., radio) network with these connectivity properties. Our approximation factors are tight up to constant factors, as none of these problems admit a (2 − ε)-approximation assuming P ≠ NP.
Description
14th International Workshop, APPROX 2011, and 15th International Workshop, RANDOM 2011, Princeton, NJ, USA, August 17-19, 2011. Proceedings
Date issued
2011-08Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory; Massachusetts Institute of Technology. Department of Electrical Engineering and Computer ScienceJournal
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Publisher
Springer Berlin / Heidelberg
Citation
Berman, Piotr, Erik D. Demaine, and Morteza Zadimoghaddam. “O(1)-Approximations for Maximum Movement Problems.” Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. Ed. Leslie Ann Goldberg et al. LNCS Vol. 6845. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. 62–74.
Version: Author's final manuscript
ISBN
978-3-642-22934-3
ISSN
0302-9743
1611-3349