Approximation Algorithms for Dominating Set in Disk Graphs

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)

• Type: Journal
• Year: 2010
• Where: CORR
• Authors: Matt Gibson, Imran A. Pirwani
• Keywords: Associated Rational Weight, CORR 2010, Disk Graphs, Education, Lowest Cost