Weighted upper domination number

doi:10.1016/j.endm.2017.10.030

Electronic Notes in Discrete Mathematics

Volume 62, November 2017, Pages 171-176

https://doi.org/10.1016/j.endm.2017.10.030 Get rights and content

Abstract

The cardinality of a maximum minimal dominating set of a graph is called its upper domination number. The problem of computing this number is generally NP-hard but can be solved in polynomial time in some restricted graph classes. In this work, we consider the complexity and approximability of the weighted version of the problem in two special graph classes: planar bipartite, split. We also provide an inapproximability result for an unweighted version of this problem in regular graphs.

References (10)

Grant A. Cheston et al.
On the computational complexity of upper fractional domination
Discrete Applied Mathematics
(1990)
Ernest J. Cockayne et al.
Contributions to the theory of domination, independence and irredundance in graphs
Discrete Mathematics
(1981)
Michael S. Jacobson et al.
Chordal graphs and upper irredundance, upper domination and independence
Discrete Mathematics
(1990)
Yury L. Orlovich et al.
Approximability results for the maximum and minimum maximal induced matching problems
Discrete Optimization
(2008)
Hassan AbouEisha et al.
A dichotomy for upper domination in monogenic classes

There are more references available in the full text version of this article.

Cited by (8)

(In)approximability of maximum minimal FVS
2022, Journal of Computer and System Sciences
We study the approximability of the NP-complete Maximum Minimal Feedback Vertex Set problem. Informally, this natural problem seems to lie in an intermediate space between two more well-studied problems of this type: Maximum Minimal Vertex Cover, for which the best achievable approximation ratio is $\sqrt{n}$ , and Upper Dominating Set, which does not admit any $n^{1 - ϵ}$ approximation. We confirm and quantify this intuition by showing the first non-trivial polynomial time approximation for Maximum Minimal Feedback Vertex Set with a ratio of $O (n^{2 / 3})$ , as well as a matching hardness of approximation bound of $n^{2 / 3 - ϵ}$ , improving the previously known hardness of $n^{1 / 2 - ϵ}$ . Having settled the problem's approximability in polynomial time, we move to the context of super-polynomial time. We devise a generalization of our approximation algorithm which, for any desired approximation ratio r, produces an r-approximate solution in time $n^{O (n / r^{3 / 2})}$ . This time-approximation trade-off is essentially tight under the ETH.
Domination in Graphs: Core Concepts
2023, Springer Monographs in Mathematics
(In)approximability of maximum minimal FVS
2020, Leibniz International Proceedings in Informatics, LIPIcs
(In)approximability of maximum minimal FVS
2020, arXiv
Weighted upper edge cover: Complexity and approximability
2020, Journal of Graph Algorithms and Applications
Formalization of the domination chain with weighted parameters
2019, Leibniz International Proceedings in Informatics, LIPIcs

View all citing articles on Scopus

¹: Postdoctoral researcher, Université Paris-Dauphine.

View full text

Weighted upper domination number

Abstract

Discrete Applied Mathematics

Discrete Mathematics

Discrete Mathematics

Discrete Optimization

A dichotomy for upper domination in monogenic classes