Fast Algorithms for min independent dominating set.

Nicolas Bourgeois Bruno Escoffier Vangelis Th. Paschos

Published in: SIROCCO (2010)

Keyphrases

data structure
computational cost
worst case
computationally expensive
dominating set
simulated annealing
computationally efficient
theoretical analysis
orders of magnitude
combinatorial optimization
lower and upper bounds