An Approximation Algorithm for Weak Vertex Cover Problem in Network Management.

Zhiping Cai Jianping Yin Xianghui Liu Shaohe Lv

Published in: AAIM (2005)

Keyphrases

vertex cover
network management
learning algorithm
approximation algorithms
polynomial time approximation
search space
np hard
objective function
error bounds
combinatorial optimization
theoretical analysis
computational complexity
probabilistic model
dynamic programming
special case
bin packing
optimal solution