Login / Signup

Polynomial Time Approximation Scheme for the Rectilinear Steiner Arborescence Problem.

Bing LuLu Ruan
Published in: J. Comb. Optim. (2000)
Keyphrases
  • polynomial time approximation
  • np hard
  • approximation algorithms
  • error bounds
  • vertex cover
  • identical machines
  • scheduling problem
  • linear programming
  • training examples
  • branch and bound algorithm