Anzeige
Erschienen in:
2010 | OriginalPaper | Buchkapitel
Fast Algorithms for min independent dominating set
verfasst von : Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos
Erschienen in: Structural Information and Communication Complexity
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
We first devise a branching algorithm that computes a minimum independent dominating set with running time
O
*
(2
0.424
n
) and polynomial space. This improves the
O
*
(2
0.441
n
) result by (S. Gaspers and M. Liedloff,
A branch-and-reduce algorithm for finding a minimum independent dominating set in graphs
, Proc. WG’06). We then study approximation of the problem by moderately exponential algorithms and show that it can be approximated within ratio 1 +
ε
, for any
ε
> 0, in a time smaller than the one of exact computation and exponentially decreasing with
ε
. We also propose approximation algorithms with better running times for ratios greater than 3.