{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:46:32Z","timestamp":1725558392756},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405450"},{"type":"electronic","value":"9783540450788"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45078-8_17","type":"book-chapter","created":{"date-parts":[[2010,6,22]],"date-time":"2010-06-22T17:23:52Z","timestamp":1277227432000},"page":"186-197","source":"Crossref","is-referenced-by-count":2,"title":["Routing and Call Control Algorithms for Ring Networks"],"prefix":"10.1007","author":[{"given":"R. Sai","family":"Anand","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Erlebach","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"788","DOI":"10.1007\/3-540-45465-9_67","volume-title":"Automata, Languages and Programming","author":"U. Adamy","year":"2002","unstructured":"Adamy, U., Ambuehl, C., Anand, R.S., Erlebach, T.: Call control in rings. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 788\u2013799. Springer, Heidelberg (2002)"},{"key":"17_CR2","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, pp. 1\u201310 (1999)"},{"key":"17_CR3","volume-title":"Network flows: Theory, algorithms and application","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network flows: Theory, algorithms and application. Prentice-Hall, NewYork (1993)"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Anand, R.S., Erlebach, T.: Routing and call control algorithms for ring networks. Technical Report TIK-Report 171, ETH Z\u00fcrich, (May 2003), Available electronically at ftp:\/\/ftp.tik.ee.ethz.ch\/pub\/publications\/TIK-Report171.pdf","DOI":"10.1007\/978-3-540-45078-8_17"},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/3-540-44634-6_15","volume-title":"Algorithms and Data Structures","author":"A. Blum","year":"2001","unstructured":"Blum, A., Kalai, A., Kleinberg, J.: Admission control to minimize rejections. In: Dehne, F., Sack, J.-R., Tamassia, R. (eds.) WADS 2001. LNCS, vol.\u00a02125, pp. 155\u2013164. Springer, Heidelberg (2001)"},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0166-218X(93)E0174-W","volume":"59","author":"M.C. Carlisle","year":"1995","unstructured":"Carlisle, M.C., Lloyd, E.L.: On the k-coloring of intervals. Discrete Applied Mathematics\u00a059, 225\u2013235 (1995)","journal-title":"Discrete Applied Mathematics"},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/3-540-44683-4_31","volume-title":"Mathematical Foundations of Computer Science 2001","author":"T. Erlebach","year":"2001","unstructured":"Erlebach, T.: Approximation algorithms and complexity results for path problems in trees of rings. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol.\u00a02136, pp. 351\u2013362. Springer, Heidelberg (2001)"},{"issue":"3","key":"17_CR8","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1137\/S0895480199361259","volume":"14","author":"T. Erlebach","year":"2001","unstructured":"Erlebach, T., Jansen, K.: The maximum edge-disjoint paths problem in bidirected trees. SIAM Journal on Discrete Mathematics\u00a014(3), 326\u2013355 (2001)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"17_CR9","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 algorithm. Journal of Algorithms\u00a023, 180\u2013194 (1997)","journal-title":"Journal of Algorithms"},{"issue":"1","key":"17_CR10","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF02523685","volume":"18","author":"N. Garg","year":"1997","unstructured":"Garg, N., Vazirani, V.V., Yannakakis, M.: Primal-dual approximation algorithms for integral flow and multicut in trees. Algorithmica\u00a018(1), 3\u201320 (1997)","journal-title":"Algorithmica"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Nomikos, C., Pagourtzis, A., Zachos, S.: Minimizing request blocking in all-optical rings. In: IEEE INFOCOM (2003)","DOI":"10.1109\/INFCOM.2003.1208971"},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0095-8956(81)80012-3","volume":"31","author":"H. Okamura","year":"1981","unstructured":"Okamura, H., Seymour, P.: Multicommodity flows in planar graphs. Journal of Combinatorial Theory, Series B\u00a031, 75\u201381 (1981)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Wan, P.J., Liu, L.: Maximal throughput in wavelength-routed optical networks. In: Multichannel Optical Networks: Theory and Practice. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a046, pp. 15\u201326. AMS (1998)","DOI":"10.1090\/dimacs\/046\/02"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45078-8_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,29]],"date-time":"2021-10-29T20:15:13Z","timestamp":1635538513000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45078-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405450","9783540450788"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45078-8_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}