Approximation for minimum total dominating set

Authors:
Junmin Zhu
Affiliations:
Shanghai Jiao Tong University, Shanghai, China
Venue:
Proceedings of the 2nd International Conference on Interaction Sciences: Information Technology, Culture and Human
Year:
2009

Citing 12
Cited 1

Integer and combinatorial optimization

Integer and combinatorial optimization
Optimization, approximation, and complexity classes

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
On approximating the minimum independent dominating set

Information Processing Letters
Approximation of k-set cover by semi-local optimization

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A threshold of ln n for approximating set cover

Journal of the ACM (JACM)
Non-approximability results for optimization problems on bounded degree instances

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Some optimal inapproximability results

Journal of the ACM (JACM)
The importance of being biased

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Approximation Algorithms for Connected Dominating Sets

ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
A new multilayered PCP and the hardness of hypergraph vertex cover

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
On syntactic versus computational views of approximability

SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science

Parameterized complexity and inapproximability of dominating set problem in chordal and near chordal graphs

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

A total dominating set is a dominating set which induces a subgraph without isolated vertices. In this paper, we study the approximation of minimum total dominating set problem. First, we present a new analysis for one-step greedy algorithm with approximation ratio ln(δ-0.5)+1.5, where δ is the maximum degree of the given graph. Second, we prove some approximation hardness of this problem on various classes of graphs, including sparse graphs, small degree graphs, directed graphs, etc.