An Improved Deterministic Algorithm for the Online Min-Sum Set Cover Problem.

Mateusz Basiak Marcin Bienkowski Agnieszka Tatarczuk

Published in: WAOA (2023)

Keyphrases

set cover
np hard
k means
dynamic programming
computational complexity
worst case
network flow
greedy heuristic
segmentation algorithm
combinatorial optimization
convex hull
min sum