NuMWVC: A Novel Local Search for Minimum Weighted Vertex Cover Problem.
Ruizhi LiShaowei CaiShuli HuMinghao YinJian GaoPublished in: AAAI (2018)
Keyphrases
- vertex cover
- approximation algorithms
- minimum cost
- planar graphs
- search algorithm
- partial order
- precedence constraints
- optimality criterion
- constant factor
- polynomial time approximation
- simulated annealing
- branch and bound algorithm
- special case
- combinatorial optimization
- log likelihood
- search space
- genetic algorithm
- tabu search
- upper bound
- np hard
- undirected graph