Login / Signup
The Online Min-Sum Set Cover Problem.
Dimitris Fotakis
Loukas Kavouras
Grigorios Koumoutsos
Stratis Skoulakis
Manolis Vardas
Published in:
ICALP (2020)
Keyphrases
</>
set cover
min sum
np hard
greedy algorithm
approximation algorithms
network flow
special case
higher order
greedy heuristic
lower bound
linear programming
clustering algorithm
solution space
scheduling problem
multi objective
evolutionary algorithm
optimal solution