{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T14:26:10Z","timestamp":1773325570725,"version":"3.50.1"},"reference-count":18,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2004,3,1]],"date-time":"2004-03-01T00:00:00Z","timestamp":1078099200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3461,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2004,3]]},"DOI":"10.1016\/s0166-218x(03)00259-2","type":"journal-article","created":{"date-parts":[[2003,9,16]],"date-time":"2003-09-16T22:32:50Z","timestamp":1063751570000},"page":"159-171","source":"Crossref","is-referenced-by-count":26,"title":["Spanners and message distribution in networks"],"prefix":"10.1016","volume":"137","author":[{"given":"Arthur M.","family":"Farley","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Proskurowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Zappala","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kurt","family":"Windisch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(03)00259-2_BIB1","doi-asserted-by":"crossref","unstructured":"A.J. Ballardie, P.F. Francis, J. Crowcroft, Core based trees, in: Proceedings of ACM SIGCOMM, London, August 1993.","DOI":"10.1145\/166237.166246"},{"key":"10.1016\/S0166-218X(03)00259-2_BIB2","first-page":"110","article-title":"NP-Completeness results for minimum plannar spanners","volume":"3","author":"Brandes","year":"1998","journal-title":"Discr. Math. Theoret. Comput. Sci."},{"key":"10.1016\/S0166-218X(03)00259-2_BIB3","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0166-218X(94)90073-6","article-title":"NP-completeness of minimum spanner problem","volume":"48","author":"Cai","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(03)00259-2_BIB4","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1137\/S0895480192237403","article-title":"Tree spanners","volume":"8","author":"Cai","year":"1995","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0166-218X(03)00259-2_BIB5","unstructured":"K. Calvert, E. Zegura, Georgia Tech Internetwork Topology Models, Software at http:\/\/www.cc.gatech.edu."},{"key":"10.1016\/S0166-218X(03)00259-2_BIB6","unstructured":"S. Deering, D. Estrin, D. Farinacci, V. Jacobson, A. Helmy, D. Meyer, L. Wei, Protocol Independent Multicast Version 2 Dense Mode Specification, Internet Draft: work in progress, June 1999."},{"key":"10.1016\/S0166-218X(03)00259-2_BIB7","doi-asserted-by":"crossref","unstructured":"S. Deering, D. Estrin, D. Farinacci, V. Jacobson, C.-G. Liu, L. Wei, An architecture for wide-area multicast routing, in: Proceedings of ACM SIGCOMM, San Francisco, August 1994.","DOI":"10.1145\/190314.190326"},{"key":"10.1016\/S0166-218X(03)00259-2_BIB8","unstructured":"A. Farley, A. Proskurowski, K. Windish, Spanners and message distribution in networks, Technical Report UO-TR-99-02, University of Oregon, 1999."},{"key":"10.1016\/S0166-218X(03)00259-2_BIB9","unstructured":"A. Farley, A. Proskurowski, D. Zappala, Domcast: a multicore multicast protocol, Technical Report UO-TR-01-02, University of Oregon, 2001."},{"key":"10.1016\/S0166-218X(03)00259-2_BIB10","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00288961","article-title":"A fast algorithm for Steiner trees","volume":"15","author":"Kou","year":"1981","journal-title":"Acta Inform."},{"key":"10.1016\/S0166-218X(03)00259-2_BIB11","unstructured":"Y. Mansour, D. Peleg, An approximation algorithm for minimum-cost network design, Technical Report CS94-22, Weizmann Institute of Science, Faculty of Mathematical Sciences, January 1, 1994."},{"key":"10.1016\/S0166-218X(03)00259-2_BIB12","doi-asserted-by":"crossref","unstructured":"D. Peleg, J.D. Ullman, An optimal synchronizer for the hypercube, in: Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing, Vancouver, British Columbia, Canada, 10\u201312 August 1987, pp. 77\u201385.","DOI":"10.1145\/41840.41847"},{"key":"10.1016\/S0166-218X(03)00259-2_BIB13","doi-asserted-by":"crossref","unstructured":"D. Waitzman, C. Partridge, S. Deering, Distance vector multicast routing protocol, RFC 1075, November 1988.","DOI":"10.17487\/rfc1075"},{"key":"10.1016\/S0166-218X(03)00259-2_BIB14","unstructured":"D.W. Wall, Mechanisms for broadcast and selective broadcast, Ph.D. Thesis, Department of Electrical Engineering, Stanford University, 1980."},{"issue":"9","key":"10.1016\/S0166-218X(03)00259-2_BIB15","doi-asserted-by":"crossref","first-page":"1617","DOI":"10.1109\/49.12889","article-title":"Routing of multipoint connections","volume":"6","author":"Waxman","year":"1988","journal-title":"IEEE J. Selected Areas Comm."},{"key":"10.1016\/S0166-218X(03)00259-2_BIB16","unstructured":"L. Wei, D. Estrin, The trade-offs of multicast trees and algorithms, in: Proceedings of 1994 International Conference on Computer Communications Networks, San Francisco, September 1994."},{"issue":"2","key":"10.1016\/S0166-218X(03)00259-2_BIB17","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1002\/net.3230170203","article-title":"Steiner problem in networks","volume":"17","author":"Winter","year":"1987","journal-title":"IEEE Networks"},{"key":"10.1016\/S0166-218X(03)00259-2_BIB18","doi-asserted-by":"crossref","unstructured":"E.W. Zegura, K. Calvert, S. Bhattacharjee, How to model an internetwork, in: IEEE INFOCOM, San Francisco, 1996.","DOI":"10.1109\/INFCOM.1996.493353"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X03002592?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X03002592?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,25]],"date-time":"2020-03-25T15:59:45Z","timestamp":1585151985000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X03002592"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,3]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2004,3]]}},"alternative-id":["S0166218X03002592"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(03)00259-2","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2004,3]]}}}