Double Partition: (6 + ε)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs

  • Ding-Zhu Du
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5034)

Abstract

We introduce a new technique on partition, called double partition. With this new type of partition, we obtain a polynomial time (6 + ε)-approximation (ε> 0) for the minimum weight dominating set problem in unit disk graphs, which improves a recent result of a 72-approximation given by Ambühl et al. for solving a long-standing open problem. As a corollary, we obtain a (9.875 + ε)-approximation for the minimum weight connected dominating set problem in unit disk graphs.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Ding-Zhu Du
    • 1
  1. 1.Science College, Xi’an Jiaotong University, Xi’an, China, and, Department of Computer Science and Engineering, University of Texas at Dallas, Richardson, TX 75083 

Personalised recommendations