Parameterized Complexity of Red Blue Set Cover for Lines.
Pradeesha AshokSudeshna KolaySaket SaurabhPublished in: LATIN (2016)
Keyphrases
- set cover
- parameterized complexity
- np hard
- fixed parameter tractable
- greedy algorithm
- approximation algorithms
- greedy heuristics
- network flow
- solution space
- global constraints
- greedy heuristic
- convex hull
- symmetry breaking
- np complete
- special case
- lower bound
- optimal solution
- constraint satisfaction problems
- linear programming
- scheduling problem
- feasible solution
- knapsack problem
- constraint satisfaction
- worst case
- dynamic programming
- computational complexity