Fixed-Parameter Tractable Algorithms for Tracking Set Problems.
Aritra BanikPratibha ChoudharyPublished in: CALDAM (2018)
Keyphrases
- fixed parameter tractable
- computational problems
- np complete
- parameterized complexity
- optimization problems
- combinatorial optimization problems
- global constraints
- constraint satisfaction problems
- np hard
- computational complexity
- learning algorithm
- approximation algorithms
- database
- heuristic methods
- exact algorithms
- computationally hard
- bounded treewidth