Nearly Optimal Dynamic Set Cover: Breaking the Quadratic-in-f Time Barrier.

Anton Bukov Shay Solomon Tianyi Zhang

Published in: CoRR (2023)

Keyphrases

set cover
greedy algorithm
np hard
greedy heuristic
optimal solution
objective function
worst case
approximation algorithms
greedy heuristics
network flow
minimum cost
solution space
dynamic environments
dynamic programming
search space
pairwise
reinforcement learning