{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:09:01Z","timestamp":1725664141995},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540575689"},{"type":"electronic","value":"9783540482338"}],"license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57568-5_259","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:09:37Z","timestamp":1330261777000},"page":"287-296","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimal linear broadcast routing with capacity limitations"],"prefix":"10.1007","author":[{"given":"S.","family":"Bitan","sequence":"first","affiliation":[]},{"given":"S.","family":"Zaks","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"31_CR1","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1006\/jagm.1993.1015","volume":"14","author":"S. Bitan","year":"1993","unstructured":"S. Bitan and S. Zaks. Optimal linear broadcast. Journal of Algorithms, 14:288\u2013315, March 1993.","journal-title":"Journal of Algorithms"},{"key":"31_CR2","unstructured":"I. Cidon and I. S. Gopal. Paris: An approach to private integrated networks. Journal of Analog and Digital Cabled Systems, June 1988."},{"issue":"4","key":"31_CR3","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1016\/0196-6774(89)90002-3","volume":"10","author":"G. T. Chou","year":"1989","unstructured":"G. T. Chou and I. S. Gopal. Linear broadcast routing. Journal of Algorithms, 10(4):490\u2013517, 1989.","journal-title":"Journal of Algorithms"},{"key":"31_CR4","unstructured":"S. Even. Graph Algorithms. Computer Science Press, 1979."},{"key":"31_CR5","unstructured":"M. R. Garey and D. S. Johnson. Computers and Intractability. Freeman, 1979."},{"key":"31_CR6","unstructured":"M. R. Garey, D. S. Johnson, and R. E. Tarjan. The planar hamiltonian circuit problem is np-complete. SIAM Journal of Computing."},{"key":"31_CR7","unstructured":"I. S. Gopal I. Cidon and S. Kutten. New models and algorithms for future networks. In Proceedings of the 7'th Annual ACM Symposium on Principles of Distributed Computing, pages 75\u201389, Toronto, CANADA, August 1988."},{"issue":"1","key":"31_CR8","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1109\/TIT.1983.1056620","volume":"IT-29","author":"A. Segall","year":"1983","unstructured":"A. Segall. Distributed networks protocols. IEEE Trans. on Information Theory, IT-29(1):23\u201335, January 1983.","journal-title":"IEEE Trans. on Information Theory"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57568-5_259","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T02:05:23Z","timestamp":1578535523000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57568-5_259"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540575689","9783540482338"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-57568-5_259","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]},"assertion":[{"value":"1 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}