# Upper Domination: Complexity and Approximation

@inproceedings{Bazgan2016UpperDC,
title={Upper Domination: Complexity and Approximation},
author={Cristina Bazgan and Ljiljana Brankovic and Katrin Casel and Henning Fernau and Klaus Jansen and Kim-Manuel Klein and Michael Lampis and Mathieu Liedloff and J{\'e}r{\^o}me Monnot and Vangelis Th. Paschos},
booktitle={IWOCA},
year={2016}
}
• Published in IWOCA 17 August 2016
• Mathematics, Computer Science

### On the max min vertex cover problem

• Computer Science, Mathematics
Discret. Appl. Math.
• 2015

### Fast algorithms for min independent dominating set

• Computer Science
Discret. Appl. Math.
• 2010
Approximation of the problem by moderately exponential time algorithms is studied and it is shown that it can be approximated within ratio [email protected], for any @e>0, in a time smaller than the one of exact computation and exponentially decreasing with @e.

### On the Enumeration of Minimal Dominating Sets and Related Notions

• Mathematics
SIAM J. Discret. Math.
• 2014
It is shown that there exists an output-polynomial time algorithm for the Dom-enum problem (or equivalently Trans-Enum problem) if and only if there exists one for the following enumeration problems: minimal total dominating sets, minimal total dominate sets in split graphs, minimal connected dominating sets insplit graphs, and minimal total dominated sets in co-bipartite graphs.

• Mathematics