The Dominating Set Problem Is Fixed Parameter Tractable for Graphs of Bounded Genus.
John A. EllisHongbing FanMichael R. FellowsPublished in: SWAT (2002)
Keyphrases
- fixed parameter tractable
- dominating set
- connected dominating set
- bounded treewidth
- parameterized complexity
- computational problems
- np hard
- facility location problem
- np complete
- global constraints
- conjunctive queries
- approximation algorithms
- vertex set
- special case
- reasoning tasks
- lower bound
- facility location
- boolean functions
- random graphs
- genetic algorithm
- branch and bound
- decision problems
- worst case
- evolutionary algorithm
- optimal solution