On Hardness of Approximation of Parameterized Set Cover and Label Cover: Threshold Graphs from Error Correcting Codes.
Karthik C. S.Inbal Livni NavonPublished in: CoRR (2020)
Keyphrases
- set cover
- error correcting codes
- approximation algorithms
- np hard
- worst case
- greedy algorithm
- error correction
- special case
- error correcting
- minimum distance
- network flow
- minimum cost
- convex hull
- lower bound
- greedy heuristic
- primal dual
- np complete
- upper bound
- decoding algorithm
- neural network
- integer programming
- solution space
- class labels
- computational complexity
- optimal solution
- graph mining
- constraint satisfaction
- feature vectors