Set Cover in Sub-linear Time.

Piotr Indyk Sepideh Mahabadi Ronitt Rubinfeld Ali Vakilian Anak Yodpinyanee

Published in: CoRR (2019)

Keyphrases

set cover
greedy algorithm
approximation algorithms
worst case
network flow
np hard
greedy heuristics
greedy heuristic
solution space
convex hull
knapsack problem
special case
linear programming
integer programming
lower bound
objective function
data sets