External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Tags

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Near Optimal Algorithms for Finding Minimum Steiner Trees on Random Graphs

Ludek Kucera, Alberto Marchetti-Spaccamela, Marco Protasi, Maurizio Talamo. Near Optimal Algorithms for Finding Minimum Steiner Trees on Random Graphs. In Jozef Gruska, Branislav Rovan, Juraj Wiedermann, editors, Mathematical Foundations of Computer Science 1986, Bratislava, Czechoslovakia, August 25-29, 1996, Proceedings. Volume 233 of Lecture Notes in Computer Science, pages 501-511, Springer, 1986.

Abstract

Abstract is missing.

runs on