Parameterized Complexity of Conflict-Free Set Cover.
Ashwin JacobDiptapriyo MajumdarVenkatesh RamanPublished in: Theory Comput. Syst. (2021)
Keyphrases
- conflict free
- set cover
- parameterized complexity
- np hard
- fixed parameter tractable
- greedy algorithm
- approximation algorithms
- functional dependencies
- network flow
- greedy heuristic
- database schemes
- argumentation frameworks
- solution space
- global constraints
- computational problems
- convex hull
- linear programming
- np complete
- scheduling problem
- integer programming
- optimal solution
- special case
- worst case
- databases
- learning algorithm
- data mining
- search space
- decision problems
- metaheuristic