Login / Signup

Efficient Heuristics for Orientation Metric and Euclidean Steiner Tree Problems.

Y. Y. LiKwong-Sak LeungC. K. Wong
Published in: J. Comb. Optim. (2000)
Keyphrases
  • steiner tree
  • euclidean distance
  • optimization problems
  • heuristic search
  • np complete
  • euclidean metric
  • upper bound
  • computationally expensive
  • combinatorial optimization