{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T18:31:29Z","timestamp":1761935489979,"version":"build-2065373602"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1996,6,1]],"date-time":"1996-06-01T00:00:00Z","timestamp":833587200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mobile Netw Appl"],"published-print":{"date-parts":[[1996,6]]},"DOI":"10.1007\/bf01193338","type":"journal-article","created":{"date-parts":[[2005,2,17]],"date-time":"2005-02-17T22:18:33Z","timestamp":1108678713000},"page":"221-232","source":"Crossref","is-referenced-by-count":31,"title":["Efficient solutions to multicast routing in communication networks"],"prefix":"10.1007","volume":"1","author":[{"given":"Kia","family":"Makki","sequence":"first","affiliation":[]},{"given":"Niki","family":"Pissinou","sequence":"additional","affiliation":[]},{"given":"Ophir","family":"Frieder","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","unstructured":"S. Aggarwal and A. Raghav, DUALCAST: A scheme for reliable multicasting,Proc. Int. Conf. on Network Protocols, Boston Massachusetts, (October 25?28, 1994) pp. 15?22.","DOI":"10.1109\/ICNP.1994.344381"},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"M.H. Ammar, S.Y. Cheung and C.M. Scoglio, Routing Multipoint Connections using virtual paths in an ATM network,Proc. IEEE INFOCOM (1993) pp. 98?105.","DOI":"10.1109\/INFCOM.1993.253244"},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"B. Awerbuch and D. Plege, Concurrent online tracking of mobile users,Proc. ACM SIGCOMM Symp. on Communications, Architectures and Protocols (September 1991) pp. 221?233.","DOI":"10.1145\/115992.116013"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"1021","DOI":"10.1145\/210118.210132","volume":"42","author":"B. Awerbuch","year":"1995","unstructured":"B. Awerbuch and D. Plege, Online tracking of mobile users, J. ACM 42 (1995) 1021?1058.","journal-title":"J. ACM"},{"key":"CR5","unstructured":"P. Bhagwat and C. Perkins, A mobile networking system based on internet protocol (IP),Proc. USENIX Symp. on Mobile & Location-Independent Computing (August 1993) pp. 69?82."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1109\/TCOM.1983.1095818","volume":"31","author":"K. Bharath-Kumar","year":"1983","unstructured":"K. Bharath-Kumar and J. Jaffee, Routing to multiple destinations in computer networks, IEEE Trans. Commun. 31 (1983) 343?351.","journal-title":"IEEE Trans. Commun."},{"key":"CR7","unstructured":"X. Chen and V. Kumar, Multicast routing in self-routing multistage networks,Proc. IEEE INFOCOM (June 1994)."},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"C.H. Chow, On multicast path finding algorithms,Proc. IEEE INFOCOM, New York (1991) pp. 1274?1283.","DOI":"10.1109\/INFCOM.1991.147651"},{"key":"CR9","doi-asserted-by":"crossref","unstructured":"R. Cohen and A. Segell, Connection management and rerouting in ATM networks,Proc. IEEE INFOCOM (June 1994) pp. 67?75.","DOI":"10.1109\/INFCOM.1994.337618"},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"S. Deering and D. Cheriton, Multicast routing in datagram internetworks and extended lans, ACM Trans. Comp. Syst. (May 1990) 85?111.","DOI":"10.1145\/78952.78953"},{"key":"CR11","doi-asserted-by":"crossref","unstructured":"S. Deering, D. Estrin, V. Farinacci, C. Jacobson, C. Liu and L. Wei, An architecture for wide-area multicast routing,Proc. ACM SIGCOMM, London (September, 1994) pp. 102?110.","DOI":"10.1145\/190314.190326"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.E. Dijkstra","year":"1995","unstructured":"E.E. Dijkstra, A note on two problems in connection with graphs. Numer. Mathematik 1 (1995) 269?271.","journal-title":"Numer. Mathematik"},{"key":"CR13","doi-asserted-by":"crossref","unstructured":"D. Duchamp, S.K. Feiner, J. Gerald and Q. Maguire, Software technology for wireless mobile computing, IEEE Network Mag. (November 1991) 12?18.","DOI":"10.1109\/65.103804"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/367766.368168","volume":"5","author":"R.W. Flod","year":"1962","unstructured":"R.W. Flod, Algorithm 97: Shortest path, Commun. ACM 5 (1962) 345.","journal-title":"Commun. ACM"},{"issue":"4","key":"CR15","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1109\/2.274999","volume":"27","author":"G.H. Forman","year":"1994","unstructured":"G.H. Forman and J. Zahorjan, The challenges of mobile computing, IEEE Comp. 27 (4) (1994) 38?47.","journal-title":"IEEE Comp."},{"key":"CR16","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"M.L. Fredman","year":"1985","unstructured":"M.L. Fredman and R.E. Tarjan, Fibonacci heaps and their uses in improved network optimization, J. ACM 34 (1985) 596?615.","journal-title":"J. ACM"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"835","DOI":"10.1137\/0132072","volume":"32","author":"M.R. Gary","year":"1977","unstructured":"M.R. Gary, R.L. Graham and D.S. Johnson, The complexity of computing steiner trees, SIAM J. Appl. Math. 32 (1977) 835?859.","journal-title":"SIAM J. Appl. Math."},{"key":"CR18","volume-title":"Computers and intractability, A Guide to the Theory of NP-Completeness","author":"M.R. Gary","year":"1979","unstructured":"M.R. Gary and D.S. Johnson, Computers and intractability, A Guide to the Theory of NP-Completeness (Freeman, San Francisco, 1979)."},{"key":"CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0116001","volume":"16","author":"E.N. Gilbert","year":"1968","unstructured":"E.N. Gilbert and H.O. Pollak, Steiner minimal trees, SIAM J. Appl. Math. 16 (1968) 1?29.","journal-title":"SIAM J. Appl. Math."},{"key":"CR20","unstructured":"D. Hayden, The new age of wireless, Mobile Office (May 1992) 34?41."},{"key":"CR21","doi-asserted-by":"crossref","unstructured":"J. Ioannidis, D. Duchamp, J. Gerald and Q. Maguire, IP-based protocols for mobile internetworking,Proc. ACM SIGCOMM Symp. on Communications, Architectures and Protocols (September 1991) 235?245.","DOI":"10.1145\/115992.116014"},{"key":"CR22","doi-asserted-by":"crossref","unstructured":"D. Johnson, Ubiquitous mobile host internetworking,Proc. IEEE Fourth Workshop on Workstation Operating Systems (October 1993) 212?219.","DOI":"10.1109\/WWOS.1993.348167"},{"key":"CR23","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Communications","author":"R.M. Karp","year":"1972","unstructured":"R.M. Karp, The reducibility among combinatorial problems,Complexity of Computer Communications, eds. R.E. Miller and J.W. Thatcher (Plenum Press, New York, 1972) pp. 85?104."},{"key":"CR24","doi-asserted-by":"crossref","unstructured":"V.P. Kompella, J.C. Pasquale and G.C. Polyzos, Multicast routing for multimedia communications, ACM\/IEEE Trans. Networking (June 1993).","DOI":"10.1109\/90.234851"},{"key":"CR25","doi-asserted-by":"crossref","unstructured":"V.P. Kompella, J.C. Pasquale and G.C. Polyzos, Multicasting for multimedia applications,1992 Proc. IEEE INFOCOM, Florence, Italy (May 1992).","DOI":"10.1109\/INFCOM.1992.263480"},{"key":"CR26","first-page":"147","volume":"59","author":"L. Kou","year":"1987","unstructured":"L. Kou and K. Makki, An even faster approximation algorithm for the Steiner tree problem in graphs,Congressus Numerantium 59 (1987) 147?154.","journal-title":"Congressus Numerantium"},{"key":"CR27","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00288961","volume":"15","author":"L. Kou","year":"1981","unstructured":"L. Kou, G. Markowsky and L. Berman, A fast algorithm for Steiner Trees, Acta Informatica 15 (1981) 141?145.","journal-title":"Acta Informatica"},{"key":"CR28","doi-asserted-by":"crossref","unstructured":"H.V. Leong and A. Si, Data broadcasting strategies over multiple unreliable wireless channels,Proc. ACM Fourth Int. Conf. on Information and Knowledge Management (November 1995) pp. 96?104, 141?145.","DOI":"10.1145\/221270.221339"},{"key":"CR29","unstructured":"K. Makki, A new approximation algorithm for the Steiner tree problem, Congressus Nmerantium 80 (1991)."},{"key":"CR30","unstructured":"K. Makki and N. Pissinou, The Steiner tree problem with minimum number of vertices in graphs,IEEE Proc. Second Great Lakes Symp. on VLSI, Kalamazoo, Michigan (February 1992."},{"issue":"8","key":"CR31","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1145\/179606.179654","volume":"37","author":"J. Moy","year":"1994","unstructured":"J. Moy, Multicast routing extensions for OSPF, Commun. ACM 37(8) (1994) 61?66.","journal-title":"Commun. ACM"},{"key":"CR32","first-page":"175","volume":"4","author":"A. Myles","year":"1993","unstructured":"A. Myles and D. Skellern, Comparison of mobile host protocols for IP internetworking, Res. and Exp 4 (1993) 175?194.","journal-title":"Res. and Exp"},{"key":"CR33","doi-asserted-by":"crossref","unstructured":"S. Paul, K. Sabnani and D. Kristol, Multicast transport protocols for high speed networks,Proc. Int. Conf. on Network Protocols, Boston Massachusetts (October 25?28, 1994) pp. 4?14.","DOI":"10.1109\/ICNP.1994.344382"},{"issue":"1","key":"CR34","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1080\/0020739830140103","volume":"14","author":"V.J. rayward-Smith","year":"1983","unstructured":"V.J. rayward-Smith, The computation of nearly minimal Steiner trees in graphs, Int. J. Math. Educ. Sci. Tech. (14) (1) (1983) 15?23.","journal-title":"Int. J. Math. Educ. Sci. Tech."},{"key":"CR35","first-page":"573","volume":"6","author":"H. Takahashi","year":"1980","unstructured":"H. Takahashi and A. Matsuyama, An approximate solution for the Steiner problem in graphs,Math. Japonica 6 (1980) 573?577.","journal-title":"Math. Japonica"},{"key":"CR36","doi-asserted-by":"crossref","unstructured":"F. Teraoka, Y. Yokote and M. Tokoro, A network architecture providing host migration transparency,Proc. ACM SIGCOMM Symp. Communications, Architectures and Protocols (September 1991) pp. 209?220.","DOI":"10.1145\/115992.116012"},{"key":"CR37","doi-asserted-by":"crossref","first-page":"1617","DOI":"10.1109\/49.12889","volume":"6","author":"B.M. Waxman","year":"1988","unstructured":"B.M. Waxman, Routing of multipoint connections, IEEE J. Sel. Areas in Commun. 6 (1988) 1617?1622.","journal-title":"IEEE J. Sel. Areas in Commun."},{"key":"CR38","unstructured":"L. Wei and D. Estrin, The trade-offs of multicast trees and algorithms,Proc. Third Int. Conf. Computer Communications and Networks, San Francisco, California (September 11?14, 1994) pp. 17?24."},{"key":"CR39","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/BF00289500","volume":"23","author":"Y.F. Wu","year":"1986","unstructured":"Y.F. Wu, P. Widmayer and C.K. Wong, A faster approximation algorithm for the Steiner problem in graphs, Acta Informatica 23 (1986) 223?229.","journal-title":"Acta Informatica"},{"key":"CR40","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1007\/BF01187035","volume":"9","author":"A.Z. Zelikovsky","year":"1993","unstructured":"A.Z. Zelikovsky, An 11\/6-approximation algorithm for the network Steiner problem, Algorithmica 9 (1993) 463?470.","journal-title":"Algorithmica"}],"container-title":["Mobile Networks and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01193338.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01193338\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01193338","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T20:39:39Z","timestamp":1586119179000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01193338"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,6]]},"references-count":40,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,6]]}},"alternative-id":["BF01193338"],"URL":"https:\/\/doi.org\/10.1007\/bf01193338","relation":{},"ISSN":["1383-469X","1572-8153"],"issn-type":[{"type":"print","value":"1383-469X"},{"type":"electronic","value":"1572-8153"}],"subject":[],"published":{"date-parts":[[1996,6]]}}}