Login / Signup

A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest.

Glencora BorradailePhilip N. KleinClaire Mathieu
Published in: FOCS (2008)
Keyphrases
  • polynomial time approximation
  • approximation algorithms
  • np hard
  • error bounds
  • vertex cover
  • bin packing
  • special case
  • identical machines
  • dynamic programming
  • multi dimensional
  • theoretical analysis