A 5+epsilon (Porson)-approximation algorithm for minimum weighted dominating set in unit disk graph

Authors:
Decheng Dai;Changyuan Yu
Affiliations:
Institute for Theoretical Computer Science, Tsinghua University, Beijing, 100084, PR China;Institute for Theoretical Computer Science, Tsinghua University, Beijing, 100084, PR China
Venue:
Theoretical Computer Science
Year:
2009

Citing 9
Cited 16

Unit disk graphs

Discrete Mathematics - Topics on domination
A threshold of ln n for approximating set cover (preliminary version)

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs

Journal of Algorithms
Improved methods for approximating node weighted Steiner trees and connected dominating sets

Information and Computation
On calculating connected dominating set for efficient routing in ad hoc wireless networks

DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Approximation algorithms

Approximation algorithms
Message-optimal connected dominating sets in mobile ad hoc networks

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Computers and Intractability; A Guide to the Theory of NP-Completeness

Computers and Intractability; A Guide to the Theory of NP-Completeness
Constant-factor approximation for minimum-weight (connected) dominating sets in unit disk graphs

APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation

A PTAS for Node-Weighted Steiner Tree in Unit Disk Graphs

COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
PTAS for weighted set cover on unit squares

APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs

Theoretical Computer Science
Maximising lifetime for fault-tolerant target coverage in sensor networks

Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Approximation algorithm for the uniform bounded facility problem

FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Minimum-cost linear coverage by sensors with adjustable ranges

WASA'11 Proceedings of the 6th international conference on Wireless algorithms, systems, and applications
Wireless coverage via dynamic programming

WASA'11 Proceedings of the 6th international conference on Wireless algorithms, systems, and applications
Energy efficient data aggregation in solar sensor networks

WASA'11 Proceedings of the 6th international conference on Wireless algorithms, systems, and applications
Energy efficient joint data aggregation and link scheduling in solar sensor networks

Computer Communications
Wireless coverage with disparate ranges

MobiHoc '11 Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing
A (4+ε)-approximation for the minimum-weight dominating set problem in unit disk graphs

WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
A PTAS for the minimum weighted dominating set problem with smooth weights on unit disk graphs

Journal of Combinatorial Optimization
Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCA

Journal of Combinatorial Optimization
PTAS for the minimum weighted dominating set in growth bounded graphs

Journal of Global Optimization
Hybrid metaheuristic algorithms for minimum weight dominating set

Applied Soft Computing
Approximation algorithm for uniform bounded facility location problem

Journal of Combinatorial Optimization

Quantified Score

Hi-index	5.23

Visualization

Abstract

We study the minimum weight dominating set problem in weighted unit disk graph, and give a polynomial time algorithm with approximation ratio 5+epsilon (Porson), improving the previous best result of 6+epsilon (Porson) in [Yaochun Huang, Xiaofeng Gao, Zhao Zhang, Weili Wu, A better constant-factor approximation for weighted dominating set in unit disk graph, J. Comb. Optim. (ISSN: 1382-6905) (2008) 1573–2886. (Print) (Online)]. Combining the common technique used in the above mentioned reference, we can compute a minimum weight connected dominating set with approximation ratio 9+epsilon (Porson), beating the previous best result of 10+epsilon (Porson) in the same work.