Approximation Algorithms for Dominating Set in Disk Graphs

Details Approximation Algorithms for Dominating Set in Disk Graphs Approximation Algorithms for Dominating Set in Disk Graphs

2010-04-19

arxiv.org/abs/1004.3320v1

Computer Science

Computational Geometry

12 pages, 4 figures

Scientific paper

We consider the problem of finding a lowest cost dominating set in a given disk graph containing $n$ disks. The problem has been extensively studied on subclasses of disk graphs, yet the best known approximation for disk graphs has remained $O(\log n)$ -- a bound that is asymptotically no better than the general case. We improve the status quo in two ways: for the unweighted case, we show how to obtain a PTAS using the framework recently proposed (independently)by Mustafa and Ray [SoCG 09] and by Chan and Har-Peled [SoCG 09]; for the weighted case where each input disk has an associated rational weight with the objective of finding a minimum cost dominating set, we give a randomized algorithm that obtains a dominating set whose weight is within a factor $2^{O(\log^* n)}$ of a minimum cost solution, with high probability -- the technique follows the framework proposed recently by Varadarajan [STOC 10].

Affiliated with

Also associated with

No associations

Rating

Approximation Algorithms for Dominating Set in Disk Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Approximation Algorithms for Dominating Set in Disk Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Approximation Algorithms for Dominating Set in Disk Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-471593