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

David Eisenstat Philip N. Klein Claire Mathieu

Published in: SODA (2012)

Keyphrases

polynomial time approximation
vertex cover
planar graphs
approximation algorithms
np hard
error bounds
bin packing
special case
upper bound
minimum cost
parameter estimation
branch and bound algorithm
approximation ratio
approximation guarantees