On the Parameterized Complexity of Approximating Dominating Set.

Karthik C. S.Bundit Laekhanukit Pasin Manurangsi

Published in: CoRR (2017)

Keyphrases

dominating set
parameterized complexity
facility location problem
connected dominating set
fixed parameter tractable
global constraints
np complete
computational problems
symmetry breaking
simulated annealing
approximation algorithms
np hard
linear programming
facility location