A nearly best-possible approximation algorithm for node-weighted Steiner trees
Journal of Algorithms
Social potential fields: a distributed behavioral control for autonomous robots
WAFR Proceedings of the workshop on Algorithmic foundations of robotics
Broadcasting, multicasting and gossiping in trees under the all-port line model
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Optimized Broadcasting and Multicasting Protocols in Cut-Through Routed Networks
IEEE Transactions on Parallel and Distributed Systems
NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs
Journal of Algorithms
Improved methods for approximating node weighted Steiner trees and connected dominating sets
Information and Computation
Map labeling and its generalizations
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for directed Steiner problems
Journal of Algorithms
The freeze-tag problem: how to wake up a swarm of robots
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Improved approximation algorithms for the freeze-tag problem
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
A simple factor-3 approximation for labeling points with circles
Information Processing Letters
Deploying sensor networks with guaranteed capacity and fault tolerance
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Planning Algorithms
New bounds on map labeling with circular labels
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Theoretical and experimental analysis of heuristics for the "freeze-tag" robot awakening problem
IEEE Transactions on Robotics
On minimizing the sum ofensor movements for barrier coverage of a line segment
ADHOC-NOW'10 Proceedings of the 9th international conference on Ad-hoc, mobile and wireless networks
Note: Constrained k-center and movement to independence
Discrete Applied Mathematics
O(1)-Approximations for maximum movement problems
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
| Hi-index | 0.01 |
We give approximation algorithms and inapproximability results for a class of movement problems. In general, these problems involve planning the coordinated motion of a large collection of objects (representing anything from a robot swarm or firefighter team to map labels or network messages) to achieve a global property of the network while minimizing the maximum or average movement. In particular, we consider the goals of achieving connectivity (undirected and directed), achieving connectivity between a given pair of vertices, achieving independence (a dispersion problem), and achieving a perfect matching (with applications to multicasting). This general family of movement problems encompasses an intriguing range of graph and geometric algorithms, with several real-world applications and a surprising range of approximability. In some cases, we obtain tight approximation and inapproximability results using direct techniques (without use of PCP), assuming just that P ≠ NP.