An Improved Approximation Algorithm for Vertex Cover with Hard Capacities.
Rajiv GandhiEran HalperinSamir KhullerGuy KortsarzAravind SrinivasanPublished in: ICALP (2003)
Keyphrases
- vertex cover
- learning algorithm
- theoretical analysis
- approximation algorithms
- computational complexity
- objective function
- polynomial time approximation
- error bounds
- np hard
- combinatorial optimization
- worst case
- knapsack problem
- approximation ratio
- dynamic programming
- expectation maximization
- simulated annealing
- parameter estimation
- frequent patterns
- closed form
- probabilistic model
- bin packing
- optimality criterion