Fully Dynamic Set Cover via Hypergraph Maximal Matching: An Optimal Approximation Through a Local Approach.

Sepehr Assadi Shay Solomon

Published in: ESA (2021)

Keyphrases

set cover
approximation algorithms
np hard
worst case
greedy algorithm
greedy heuristic
matching algorithm
closed form
greedy heuristics
dynamic programming
minimum cost
network flow
minimum distance
computational complexity
optimal solution
special case
pairwise
hypergraph model