On Hardness of Approximation of Parameterized Set Cover and Label Cover: Threshold Graphs from Error Correcting Codes.
Karthik C. S.Inbal Livni NavonPublished in: SOSA (2021)
Keyphrases
- set cover
- error correcting codes
- approximation algorithms
- np hard
- worst case
- greedy algorithm
- network flow
- error correction
- error correcting
- special case
- minimum cost
- decoding algorithm
- np complete
- minimum distance
- primal dual
- class labels
- integer programming
- solution space
- lower bound
- multi label
- computational complexity
- objective function
- greedy heuristic
- knapsack problem
- metaheuristic
- linear programming
- dynamic programming
- optimal solution