Login / Signup
On fully dynamic constant-factor approximation algorithms for clustering problems.
Hendrik Fichtenberger
Monika Henzinger
Andreas Wiese
Published in:
CoRR (2021)
Keyphrases
</>
approximation algorithms
constant factor
vertex cover
approximation schemes
np hard
special case
randomized algorithms
worst case
lower bound
minimum cost
approximation ratio
polynomial time approximation
optimization problems
primal dual
combinatorial optimization
data points
reinforcement learning
disjoint paths