Art gallery theorems and algorithms
Art gallery theorems and algorithms
A primal-dual parallel approximation technique applied to weighted set and vertex covers
Journal of Algorithms
A General Approximation Technique for Constrained Forest Problems
SIAM Journal on Computing
On calculating connected dominating set for efficient routing in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Distributed Algorithms
Distributed Intelligent Agents
IEEE Expert: Intelligent Systems and Their Applications
A parallel implementation of an asynchronous team to the point-to-point connection problem
Parallel Computing - Special issue: Parallel computing in numerical optimization
A greedy approximation for minimum connected dominating sets
Theoretical Computer Science
Primal-dual based distributed algorithms for vertex cover with semi-hard capacities
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Distributed Search by Constrained Agents: Algorithms, Performance, Communication (Advanced Information and Knowledge Processing)
A distributed algorithm for computing Connected Dominating Set in ad hoc networks
International Journal of Wireless and Mobile Computing
Fast distributed scheduling via primal-dual
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Fast distributed algorithms via primal-dual
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
A distributed primal-dual heuristic for steiner problems in networks
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Quasi-optimal scheduling algorithm for area coverage in multi-functional sensor networks
International Journal of Ad Hoc and Ubiquitous Computing
Quasi-optimal scheduling algorithm for area coverage in multi-functional sensor networks
International Journal of Ad Hoc and Ubiquitous Computing
| Hi-index | 0.00 |
The Art Gallery Problem asks to find a minimum subset of vertices in a polygon that are sufficient to observe the interior. This problem arises in a variety of multiagent systems, including robotics, sensor networks, wireless networking, and surveillance. Despite the fact that the centralized version of the problem has been extensively studied for the past thirty years, there is relatively little in the literature describing distributed solutions to the problem that have desirable guarantees in both runtime and optimality. We propose and analyze a new distributed algorithm for approximating a solution to this problem and a number of its variants that runs in a linear number of communication rounds with respect to the number of nodes (independent of the topology of the network), and, under assumptions on the embedding of the edge weights, will run in a logarithmic number of communication rounds producing solutions within a constant factor of optimal.