A better list heuristic for vertex cover.
François DelbotChristian LaforestPublished in: Inf. Process. Lett. (2008)
Keyphrases
- vertex cover
- approximation algorithms
- partial order
- optimal solution
- precedence constraints
- planar graphs
- polynomial time approximation
- combinatorial optimization
- optimality criterion
- dynamic programming
- scheduling problem
- tabu search
- em algorithm
- np hard
- search algorithm
- simulated annealing
- mixed integer programming
- single machine scheduling problem
- bin packing