Login / Signup
An O(1)-Approximation Algorithm for Dynamic Weighted Vertex Cover with Soft Capacity.
Hao-Ting Wei
Wing-Kai Hon
Paul Horn
Chung-Shou Liao
Kunihiko Sadakane
Published in:
APPROX-RANDOM (2018)
Keyphrases
</>
vertex cover
approximation algorithms
learning algorithm
objective function
optimal solution
theoretical analysis
dynamic programming
probabilistic model
closed form
polynomial time approximation
search space
constraint programming
bin packing