Login / Signup
Approximation algorithms for submodular vertex cover problems with linear/submodular penalties using primal-dual technique.
Dachuan Xu
Fengmin Wang
Donglei Du
Chenchen Wu
Published in:
Theor. Comput. Sci. (2016)
Keyphrases
</>
approximation algorithms
vertex cover
primal dual
np hard
worst case
special case
greedy algorithm
minimum cost
approximation ratio
precedence constraints
objective function
polynomial time approximation
energy minimization
undirected graph
valid inequalities
constant factor