Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems.

Published in: COCOA (2008)

Keyphrases

approximation algorithms
vertex cover
steiner tree
np hard
randomized algorithms
special case
prize collecting
lower bound
dynamic programming
scheduling problem
objective function
benchmark problems
planar graphs