The Buss Reduction for the k-Weighted Vertex Cover Problem.

Hong Xu Xin-Zeng Wu Cheng Cheng Sven Koenig T. K. Satish Kumar

Published in: ISAIM (2018)

Keyphrases

vertex cover
approximation algorithms
partial order
planar graphs
precedence constraints
np hard
search algorithm
dynamic programming
scheduling problem
graph cuts
weighted graph