A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest.

Glencora Borradaile Philip N. Klein Claire Mathieu

Published in: ACM Trans. Algorithms (2015)

Keyphrases

polynomial time approximation
np hard
approximation algorithms
error bounds
vertex cover
bin packing
special case
learning algorithm
lower bound
scheduling problem