Login / Signup

Polynomial Time Approximation Scheme for Symmetric Rectilinear Steiner Arborescence Problem.

Xiuzhen ChengBhaskar DasGuptaBing Lu
Published in: J. Glob. Optim. (2001)
Keyphrases
  • polynomial time approximation
  • np hard
  • approximation algorithms
  • error bounds
  • special case
  • bin packing
  • identical machines
  • data structure
  • computational complexity
  • worst case
  • simulated annealing