An efficient polynomial-time approximation scheme for Steiner forest in planar graphs

David Eisenstat Philip N. Klein Claire Mathieu

Published in: CoRR (2011)

Keyphrases

polynomial time approximation
vertex cover
planar graphs
approximation algorithms
np hard
error bounds
bin packing
special case
computational complexity
probabilistic model
worst case
knapsack problem