Vertex Cover Meets Scheduling.
Leah EpsteinAsaf LevinGerhard J. WoegingerPublished in: Algorithmica (2016)
Keyphrases
- vertex cover
- precedence constraints
- scheduling problem
- approximation algorithms
- partial order
- planar graphs
- branch and bound algorithm
- scheduling algorithm
- optimality criterion
- parallel machines
- partially ordered
- special case
- resource allocation
- lower bound
- global constraints
- minimum cost
- upper bound
- polynomial time approximation