O(1)-approximations for maximum movement problems
Name
Demaine-0(1) approximations.pdf
Size
276.3 KB
Format
Adobe PDF
Checksum (MD5)
528d6d3cb9e0ed1c429b55f09a00144e
Author(s)
Berman, Piotr
Demaine, Erik D.
Zadimoghaddam, Morteza
Date Issued
August 2011
Journal
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
Abstract
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
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/978-3-642-22935-0_6
