{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:17:57Z","timestamp":1725484677201},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540434009"},{"type":"electronic","value":"9783540459958"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"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":[[2002]]},"DOI":"10.1007\/3-540-45995-2_50","type":"book-chapter","created":{"date-parts":[[2007,5,29]],"date-time":"2007-05-29T22:33:34Z","timestamp":1180478014000},"page":"584-597","source":"Crossref","is-referenced-by-count":0,"title":["On-line Algorithms for Edge-Disjoint Paths in Trees of Rings"],"prefix":"10.1007","author":[{"given":"R. Sai","family":"Anand","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Erlebach","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,3,14]]},"reference":[{"key":"50_CR1","unstructured":"Adler, R., Azar, Y.: Beating the logarithmic lower bound: randomized preemptive disjoint paths and call control algorithms. In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms SODA. (1999) 1\u201310"},{"key":"50_CR2","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., Plotkin, S.: Throughput-competitive on-line routing. In: Proceedings of the 34th AnnualSymp osium on Foundations of Computer Science FOCS. (1993) 32\u201340","DOI":"10.1109\/SFCS.1993.366884"},{"key":"50_CR3","unstructured":"Awerbuch, B., Bartal, Y., Fiat, A., Ros\u00e9n, A.: Competitive non-preemptive call control. In: Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms SODA. (1994) 312\u2013320"},{"key":"50_CR4","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Gawlick, R., Leighton, T., Rabani, Y.: On-line admission control and circuit routing for high performance computing and communication. In: Proceedings of the 35th AnnualSymp osium on Foundations of Computer Science FOCS. (1994) 412\u2013423","DOI":"10.1109\/SFCS.1994.365675"},{"key":"50_CR5","doi-asserted-by":"crossref","unstructured":"Beauquier, B., P\u00e9rennes, S., T\u00f3th, D.: All-to-all routing and coloring in weighted trees of rings. In: Proceedings of the 11th Annual ACM Symposium on Parallel Algorithms and Architectures SPAA. (1999) 185\u2013190","DOI":"10.1145\/305619.305639"},{"key":"50_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/3-540-44634-6_15","volume-title":"Admission control to minimize rejections","author":"A. Blum","year":"2001","unstructured":"Blum, A., Kalai, A., Kleinberg, J.: Admission control to minimize rejections. In: Proceedings of the 7th InternationalWorkshop on Algorithms and Data Structures WADS. LNCS 2125 (2001) 155\u2013164"},{"key":"50_CR7","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press (1998)"},{"key":"50_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1007\/3-540-40996-3_13","volume-title":"A 2-approximation algorithm for path coloring on trees of rings","author":"X. Deng","year":"2000","unstructured":"Deng, X., Li, G., Zang, W., Zhou, Y.: A 2-approximation algorithm for path coloring on trees of rings. In: Proceedings of the 11th AnnualI nternational Symposium on Algorithms and Computation ISAAC. LNCS 1969 (2000) 144\u2013155"},{"key":"50_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/3-540-44683-4_31","volume-title":"Approximation algorithms and complexity results for path problems in trees of rings","author":"T. Erlebach","year":"2001","unstructured":"Erlebach, T.: Approximation algorithms and complexity results for path problems in trees of rings. In: Proceedings of the 26th InternationalS ymposium on MathematicalF oundations of Computer Science MFCS. LNCS 2136 (2001) 351\u2013362"},{"key":"50_CR10","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1006\/jagm.1996.0821","volume":"23","author":"J.A. Garay","year":"1997","unstructured":"Garay, J.A., Gopal, I.S., Kutten, S., Mansour, Y., Yung, M.: Efficient on-line call control algorithms. Journal of Algorithms 23 (1997) 180\u2013194","journal-title":"Journal of Algorithms"},{"key":"50_CR11","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0020-0190(94)00183-Y","volume":"53","author":"R. Hassin","year":"1995","unstructured":"Hassin, R., Tamir, A.: On the minimum diameter spanning tree problem. Information Processing Letters 53 (1995) 109\u2013111","journal-title":"Information Processing Letters"},{"key":"50_CR12","unstructured":"Kleinberg, J., Tardos, \u00c9.: Disjoint paths in densely embedded graphs. In: Proceedings of the 36th AnnualSymp osium on Foundations of Computer Science FOCS. (1995) 52\u201361"}],"container-title":["Lecture Notes in Computer Science","LATIN 2002: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45995-2_50","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T19:40:04Z","timestamp":1550346004000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45995-2_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540434009","9783540459958"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-45995-2_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2002]]}}}