{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:40:17Z","timestamp":1725795617774},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662439500"},{"type":"electronic","value":"9783662439517"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43951-7_44","type":"book-chapter","created":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T04:37:49Z","timestamp":1402461469000},"page":"520-531","source":"Crossref","is-referenced-by-count":1,"title":["Optimal Competitiveness for Symmetric Rectilinear Steiner Arborescence and Related Problems"],"prefix":"10.1007","author":[{"given":"Erez","family":"Kantor","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shay","family":"Kutten","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"44_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/978-3-642-31585-5_38","volume-title":"Automata, Languages, and Programming","author":"R. Bar-Yehuda","year":"2012","unstructured":"Bar-Yehuda, R., Kantor, E., Kutten, S., Rawitz, D.: Growing half-balls: Minimizing storage and communication costs in cDNs. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012, Part II. LNCS, vol.\u00a07392, pp. 416\u2013427. Springer, Heidelberg (2012)"},{"key":"44_CR2","doi-asserted-by":"crossref","unstructured":"Bein, W., Golin, M., Larmore, L., Zhang, Y.: The knuth-yao quadrangle-inequality speedup is a consequence of total monotonicity. TOPLAS\u00a06(1) (2009)","DOI":"10.1145\/1644015.1644032"},{"key":"44_CR3","doi-asserted-by":"crossref","unstructured":"Berman, P., Coulston, C.: On-line algorrithms for steiner tree problems. In: STOC 1997, pp. 344\u2013353 (1997)","DOI":"10.1145\/258533.258618"},{"key":"44_CR4","unstructured":"Charikar, M., Halperin, D., Motwani, R.: The dynamic servers problem. In: SODA 1998, pp. 410\u2013419 (1998)"},{"issue":"4","key":"44_CR5","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1023\/A:1012730702524","volume":"21","author":"X. Cheng","year":"2001","unstructured":"Cheng, X., Dasgupta, B., Lu, B.: Polynomial time approximation scheme for symmetric rectilinear steiner arborescence problem. J. Global Optim.\u00a021(4), 385\u2013396 (2001)","journal-title":"J. Global Optim."},{"key":"44_CR6","unstructured":"Ladeira de Matos, R.R.: A rectilinear arborescence problem. Dissertation, University of Alabama (1979)"},{"issue":"1","key":"44_CR7","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1002\/net.3230220105","volume":"22","author":"D.S. Richards","year":"1992","unstructured":"Richards, D.S., Hwang, F.K.: Steiner tree problems. Networks\u00a022(1), 55\u2013897 (1992)","journal-title":"Networks"},{"key":"44_CR8","doi-asserted-by":"crossref","unstructured":"Kahng, A., Robins, G.: On optimal interconnects for vlsi. Kluwer (1995)","DOI":"10.1007\/978-1-4757-2363-2"},{"issue":"3","key":"44_CR9","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1023\/A:1009826311973","volume":"4","author":"B. Lu","year":"2000","unstructured":"Lu, B., Ruan, L.: Polynomial time approximation scheme for rectilinear steiner arborescence problem. Combinatorial Optimization\u00a04(3), 357\u2013363 (2000)","journal-title":"Combinatorial Optimization"},{"key":"44_CR10","first-page":"59","volume":"18","author":"L. Nastansky","year":"1974","unstructured":"Nastansky, L., Selkow, S.M., Stewart, N.F.: Cost minimum trees in directed acyclic graphs. Z. Oper. Res.\u00a018, 59\u201367 (1974)","journal-title":"Z. Oper. Res."},{"key":"44_CR11","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H., Ramanathan, S., Rangan, P.V.: Information caching for delivery of personalized video programs for home entertainment channels. In: IEEE International Conf. on Multimedia Computing and Systems, pp. 214\u2013223 (1994)","DOI":"10.1109\/MMCS.1994.292456"},{"key":"44_CR12","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H., Ramanathan, S., Rangan, P.V.: Optimal information delivery. In: 6th ISAAC, pp. 181\u2013187 (1995)","DOI":"10.1007\/BFb0015422"},{"issue":"3","key":"44_CR13","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1016\/0140-3664(95)98543-E","volume":"18","author":"C.H. Papadimitriou","year":"1995","unstructured":"Papadimitriou, C.H., Ramanathan, S., Rangan, P.V., Sampathkumar, S.: Multimedia information caching for personalized video-on demand. Computer Communications\u00a018(3), 204\u2013216 (1995)","journal-title":"Computer Communications"},{"key":"44_CR14","doi-asserted-by":"crossref","unstructured":"Rao, S., Sadayappan, P., Hwang, F., Shor, P.: The rectilinear steiner arborescence problem. Algorithmica, 277\u2013288 (1992)","DOI":"10.1007\/BF01758762"},{"key":"44_CR15","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: Probabilistic computations: Toward a unified measure of complexity. In: FOCS 1977, pp. 222\u2013227 (1977)","DOI":"10.1109\/SFCS.1977.24"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43951-7_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T22:24:30Z","timestamp":1558909470000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43951-7_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439500","9783662439517"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43951-7_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}