The Roman Domination Problem in Unit Disk Graphs

Authors:
Weiping Shang;Xiaodong Hu
Affiliations:
Institute of Applied Mathematics, Chinese Academy of Sciences, P. O. Box 2734, Beijing 100080, China;Institute of Applied Mathematics, Chinese Academy of Sciences, P. O. Box 2734, Beijing 100080, China
Venue:
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007
Year:
2007

Citing 6
Cited 0

Unit disk graphs

Discrete Mathematics - Topics on domination
NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs

Journal of Algorithms
Server Placements, Roman Domination and other Dominating Set Variants

TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
Defending the Roman Empire: a new strategy

Discrete Mathematics - Special issue: The 18th British combinatorial conference
A PTAS for the minimum dominating set problem in unit disk graphs

WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
A robust PTAS for maximum weight independent sets in unit disk graphs

WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.