Login / Signup
Fully Dynamic Set Cover via Hypergraph Maximal Matching: An Optimal Approximation Through a Local Approach.
Sepehr Assadi
Shay Solomon
Published in:
CoRR (2021)
Keyphrases
</>
set cover
approximation algorithms
np hard
worst case
greedy heuristics
closed form
network flow
greedy heuristic
higher order
minimum cost
matching algorithm
greedy algorithm
minimum distance
optimal solution
primal dual
image processing
multi dimensional
dynamic programming
special case
error tolerance