Login / Signup

A comparison of Steiner tree relaxations.

Tobias PolzinSiavash Vahdati Daneshmand
Published in: Discret. Appl. Math. (2001)
Keyphrases
  • steiner tree
  • linear programming relaxation
  • np hard
  • facility location
  • search algorithm
  • lower bound