The k-Steiner ratio in graphs

Authors:
Al Borchers;Ding-Zhu Du
Affiliations:
Department of Computer Science, University of Minnesota, Minneapolis, MN;Department of Computer Science, University of Minnesota, Minneapolis, MN
Venue:
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Year:
1995

The steiner problem with edge lengths 1 and 2,

Information Processing Letters
On better heuristic for euclidean Steiner minimum trees (extended abstract)

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Improved approximations for the Steiner tree problem

SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
On component-size bounded Steiner trees

Discrete Applied Mathematics - Special volume: Aridam VI and VII, Rutcor, New Brunswick, NJ, USA (1991 and 1992)

Hi-index	0.00