Simpler constant factor approximation algorithms for weighted flow time - now for any p-norm.

Alexander Armbruster Lars Rohwedder Andreas Wiese

Published in: CoRR (2023)

Keyphrases

approximation algorithms
constant factor
np hard
special case
worst case
min cost
minimum cost
sample complexity
vertex cover
randomized algorithms
lower bound
approximation ratio
upper bound
primal dual
constant factor approximation
approximation guarantees
sample size
online learning
active learning