Documents Related by Co-Citation

247 A fast algorithm for Steiner trees – L Kou, G Markowsky, L Berman - 1981
89 Routing to multiple destinations in Computer Networks – K Bharath-Kumar, J Jaffe - 1983
644 Routing of multipoint connections – B M Waxman - 1988
225 An approximate solution for the Steiner problem in graphs – H Takahashi, A Matsuyama - 1980
116 How Bad is Naive Multicast Routing? – Matthew Doar, Ian Leslie - 1993
10988 Computers and Intractability: A Guide to the Theory of NP-completeness – M Garey, D Johnson - 1979
1427 A Note on Two Problems in Connexion with Graphs – E. W. Dijkstra - 1959
41 Multicasting For Multimedia Applications – Vachaspathi Kompella, Joseph C. Pasquale, George C. Polyzos - 1992
534 Shortest connection networks and some generalizations – R Prim - 1957
8557 R.: Introduction to Algorithms – T Cormen, C Leiserson, Rivest - 1990
349 Steiner tree problems – F K Hwang, D S Richards - 1992
54 A Source-Based Algorithm For Delay-Constrained Minimum-Cost Multicasting – Qing Zhu, Mehrdad Parsa, J. J. Garcia-Luna-Aceves - 1995
274 Multicast routing in internetworks and extended lans – Stephen E. Deering - 1988
146 Dynamic Steiner tree problem – M Imase, B M Waxman - 1991
70 Multicast Routing with End-to-End Delay and Delay Variation Constraints – George N. Rouskas, Ilia Baldine - 1995
985 Multicast Routing in Datagram Internetworks and Extended LANs – Stephen E. Deering, David R. Cheriton - 1990
152 Steiner problem in networks: A survey – P Winter - 1987
57 The computation of nearly minimal Steiner trees in graphs – V Rayward-Smith - 1983
934 RSVP: A New Resource Reservation Protocol – Lixia Zhang, Steve Deering, Deborah Estrin, Scott Shenker, Daniel Zappala - 1993