Login / Signup

Closing the gap: near-optimal Steiner trees in polynomial time.

Jeff GriffithGabriel RobinsJeffrey S. SaloweTongtong Zhang
Published in: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. (1994)
Keyphrases
  • steiner tree
  • minimum spanning tree
  • special case
  • shortest path
  • facility location
  • computational complexity
  • worst case
  • approximation algorithms
  • linear programming relaxation
  • objective function