{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:14:48Z","timestamp":1773656088712,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540571551","type":"print"},{"value":"9783540479185","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57155-8_285","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:07:15Z","timestamp":1330258035000},"page":"622-633","source":"Crossref","is-referenced-by-count":8,"title":["Greedy algorithms for the on-line steiner tree and generalized steiner problems"],"prefix":"10.1007","author":[{"given":"Jeffery","family":"Westbrook","sequence":"first","affiliation":[]},{"given":"Dicky C. K.","family":"Yan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"57_CR1","doi-asserted-by":"crossref","unstructured":"N. Alon and Y. Azar, On-Line Steiner Trees in the Euclidean Plane, Proceedings of the 8th Symposium of Computational Geometry, Berlin, 1992.","DOI":"10.1145\/142675.142744"},{"key":"57_CR2","doi-asserted-by":"crossref","unstructured":"A. Agrawal, P. Klein and R. Ravi, When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem in Networks, Proceedings of the 23rd ACM Symposium on Theory of Computing, (1991) 134\u2013144.","DOI":"10.1145\/103418.103437"},{"key":"57_CR3","doi-asserted-by":"crossref","unstructured":"B. Awerbuch, Y. Bartal and A. Fiat, Competitive Distributed File Allocation, To appear, 25th ACM Symposium on Theory of Computing, 1993.","DOI":"10.1145\/167088.167142"},{"key":"57_CR4","doi-asserted-by":"crossref","unstructured":"Y. Bartal, A. Fiat, and Y. Rabani, Competitive Algorithms for Distributed Data Management, Proceedings of the 24th Annual ACM Symposium on the Theory of Computing, (1992) 39\u201350.","DOI":"10.1145\/129712.129717"},{"key":"57_CR5","doi-asserted-by":"crossref","unstructured":"S. Ben-David, A. Borodin, R. Karp, G. Tardos and A. Wigderson, On the Power of Randomization in Online Algorithms, Proceedings of the 22nd ACM Symposium on Theory of Computing, (1990) 379\u2013386.","DOI":"10.1145\/100216.100268"},{"key":"57_CR6","first-page":"353","volume":"11","author":"F. R. K. Chung","year":"1981","unstructured":"F. R. K, Chung and R. L. Graham, On Steiner Trees for Bounded Point Sets, Geometrias Dedicata, 11 (1981) 353\u2013361.","journal-title":"Geometrias Dedicata"},{"key":"57_CR7","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1137\/0114025","volume":"14","author":"M. Hannan","year":"1966","unstructured":"M. Hannan, On Steiner's Problem with Rectilinear Distance, SIAM J. App. Maths., 14 (1966), 255\u2013265.","journal-title":"SIAM J. App. Maths."},{"issue":"3","key":"57_CR8","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1137\/0404033","volume":"4","author":"M. Imaze","year":"1991","unstructured":"M. Imaze, and B. M. Waxman, Dynamic Steiner Tree Problem, SIAM J. Disc. Math., 4(3) (1991) 369\u2013384.","journal-title":"SIAM J. Disc. Math."},{"key":"57_CR9","doi-asserted-by":"crossref","unstructured":"R. M. Karp, Reducibility among combinatorial problems, in R. E. Miller and J. W. Thatcher (eds.), Complexity of Computer Computations, Plenum Press, New York, 85\u2013103.","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"57_CR10","first-page":"185","volume":"31","author":"N. Maculan","year":"1987","unstructured":"N. Maculan, The Steiner Problem in Graphs, Ann. Dis. Maths., 31 (1987) 185\u2013212.","journal-title":"Ann. Dis. Maths."},{"key":"57_CR11","first-page":"59","volume":"18","author":"L. Nastansky","year":"1974","unstructured":"L. Nastansky, S. M. Selkow, N. F. Stewart, Cost-Minimal Trees in Directed Acyclic Graphs, Zeitschrift f\u00fcr Operations Research, 18 (1974), 59\u201367.","journal-title":"Zeitschrift f\u00fcr Operations Research"},{"key":"57_CR12","unstructured":"J. Westbrook and D. C. K. Yan, The Performance of Greedy Algorithms for the On-Line Steiner Tree and Related Problems, Technical Report YALEU\/DCS\/TR-911, Yale University, November, 1992."},{"key":"57_CR13","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1002\/net.3230170203","volume":"17","author":"P. Winter","year":"1987","unstructured":"P. Winter, Steiner Problem in Networks: A Survey, Networks, 17 (1987) 129\u2013167.","journal-title":"Networks"},{"issue":"1","key":"57_CR14","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1145\/103140.103146","volume":"16","author":"O. Wolfson","year":"1991","unstructured":"O. Wolfson and A. Milo, The Multicast Policy and Its Relationship to Replicated Data Placement, ACM Trans. Database Syst., 16(1) (1991) 181\u2013205.","journal-title":"ACM Trans. Database Syst."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57155-8_285.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:08:25Z","timestamp":1605647305000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57155-8_285"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540571551","9783540479185"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-57155-8_285","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993]]}}}