Primal-dual approximation algorithms for the Prize-Collecting Steiner Tree Problem.
Paulo FeofiloffCristina G. FernandesCarlos Eduardo FerreiraJosé Coelho de PinaPublished in: Inf. Process. Lett. (2007)
Keyphrases
- prize collecting
- approximation algorithms
- primal dual
- special case
- affine scaling
- np hard
- vertex cover
- interior point methods
- travel time
- worst case
- minimum cost
- algorithm for linear programming
- np hardness
- set cover
- constant factor
- genetic algorithm
- precedence constraints
- approximation ratio
- single machine scheduling problem
- valid inequalities
- lower bound
- linear program
- shortest path
- computational complexity