Abstract

Unit disk graphs are the intersection graphs of equal sized disks in the plane, they are widely used as a mathematical model for wireless ad-hoc networks and some problems in computational geometry. In this paper we first show that the Roman domination problem in unit disk graphs is NP-hard, and then present a simple linear time approximation algorithm and a polynomial-time approximation scheme for this problem, respectively.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call