Login / Signup

Approximations for two variants of the Steiner tree problem in the Euclidean plane $${\mathbb{R}^2}$$.

Jianping LiHaiyan WangBinchao HuangJunran Lichen
Published in: J. Glob. Optim. (2013)
Keyphrases
  • euclidean plane
  • special case
  • multicast routing
  • efficient computation
  • image segmentation
  • approximation methods
  • prize collecting
  • real world
  • learning algorithm
  • data structure
  • linear programming