Parameterized Complexity of Conflict-Free Set Cover.
Ashwin JacobDiptapriyo MajumdarVenkatesh RamanPublished in: CSR (2019)
Keyphrases
- set cover
- conflict free
- parameterized complexity
- np hard
- fixed parameter tractable
- greedy algorithm
- approximation algorithms
- functional dependencies
- network flow
- database schemes
- solution space
- greedy heuristic
- global constraints
- np complete
- linear programming
- scheduling problem
- convex hull
- minimum cost
- learning algorithm
- dynamic programming
- optimal solution
- bounded treewidth
- primal dual
- integer programming
- databases
- database design
- constraint satisfaction problems
- lower bound
- computational complexity
- worst case