An improved approximation algorithm for vertex cover with hard capacities.
Rajiv GandhiEran HalperinSamir KhullerGuy KortsarzAravind SrinivasanPublished in: J. Comput. Syst. Sci. (2006)
Keyphrases
- vertex cover
- objective function
- dynamic programming
- np hard
- search space
- learning algorithm
- polynomial time approximation
- approximation algorithms
- error bounds
- special case
- knapsack problem
- expectation maximization
- worst case
- energy function
- parameter estimation
- partial order
- theoretical analysis
- bin packing
- approximation ratio
- lower bound