A Tight Competitive Ratio for Online Submodular Welfare Maximization.

Amit Ganz Pranav Nuti Roy Schwartz

Published in: ESA (2023)

Keyphrases

online algorithms
competitive ratio
lower bound
objective function
worst case
online learning
upper bound
greedy algorithm
single machine
branch and bound algorithm
average case
branch and bound
initially unknown
support vector
optimal solution
np hard
learning algorithm