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:
CoRR (2018)
Keyphrases
</>
vertex cover
learning algorithm
approximation algorithms
objective function
dynamic programming
worst case
theoretical analysis
np hard
closed form
polynomial time approximation
graph structure
computational complexity
expectation maximization
em algorithm
error bounds
model free