Login / Signup

Bounding the expected number of rectilinear full Steiner trees.

Christian Wulff-Nilsen
Published in: Networks (2010)
Keyphrases
  • computational complexity
  • steiner tree
  • greedy algorithm
  • dynamic systems