{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:25:29Z","timestamp":1725488729200},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540668367"},{"type":"electronic","value":"9783540466918"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-46691-6_15","type":"book-chapter","created":{"date-parts":[[2007,8,9]],"date-time":"2007-08-09T20:42:24Z","timestamp":1186692144000},"page":"201-213","source":"Crossref","is-referenced-by-count":1,"title":["Approximation Algorithms for Routing and Call Scheduling in All-Optical Chains and Rings"],"prefix":"10.1007","author":[{"given":"Luca","family":"Becchetti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miriam","family":"Di Ianni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alberto","family":"Marchetti-Spaccamela","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,6,9]]},"reference":[{"key":"15_CR1","unstructured":"R.K. Ahuja, T.L. Magnanti, and J.B. Orlin. Network flows. Prentice-Hall, 1993. 208"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"B. Awerbuch, Y. Azar, A. Fiat, S. Leonardi, and A. Rosen. On-line competitive algorithms for call admission in optical networks. In Proc. of the 4th Annual European Symposium on Algorithms, 1996. 202","DOI":"10.1007\/3-540-61680-2_73"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Y. Bartal, A. Fiat, and S. Leonardi. Lower bounds for on-line graph problems with application to on-line circuit and optical-routing. In Proc. of the 28th Annual Symposium on the Theory of Computing, 1996. 202, 202","DOI":"10.1145\/237814.238001"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Y. Bartal and S. Leonardi. On-line routing in all-optical networks. In Proc. of the 24th International Colloquium on Automata, Languages and Programming, 1997. 202","DOI":"10.1007\/3-540-63165-8_207"},{"key":"15_CR5","unstructured":"L. Becchetti. Efficient Resource Management in High Bandwidth Networks. PhD thesis, Dipartimento di Informatica e Sistemistica, University of Rome \u201cLa Sapienza\u201d, 1998. 203"},{"key":"15_CR6","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1109\/49.57798","volume":"8","author":"C. Brackett","year":"1990","unstructured":"C. Brackett. Dense Wavelength Division Multiplexing Networks: Principles and Applications. IEEE Journal Selected Areas in Comm., 8, 1990. 201","journal-title":"IEEE Journal Selected Areas in Comm."},{"key":"15_CR7","unstructured":"T. Erlebach and K. Jansen. Scheduling Virtual Connections in Fast Networks. In Proc. of the 4th Parallel Systems and Algorithms Workshop PASA\u2019 96, 1996. 202"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"T. Erlebach and K. Jansen. Call Scheduling in Trees, Rings and Meshes. In Proc. of the 30th Hawaii International Conference on System Sciences, 1997. 202","DOI":"10.1109\/HICSS.1997.667220"},{"key":"15_CR9","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, San Francisco, 1979. 204"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"J. Gergov. Approximation algorithms for dynamic storage allocation. In Proc. of the 4th Annual European Symposium on Algorithms, 1996. 204, 205, 205, 207","DOI":"10.1007\/3-540-61680-2_46"},{"key":"15_CR11","unstructured":"J. Gergov. Algorithms for Compile-Time Memory Optimization. Private communication, 1998. 202, 204, 204"},{"key":"15_CR12","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1137\/0117020","volume":"17","author":"R. L. Graham","year":"1969","unstructured":"R. L. Graham. Bounds for multiprocessing timing anomalies. SIAM Journal of Applied Math., 17, 1969. 206","journal-title":"SIAM Journal of Applied Math."},{"key":"15_CR13","unstructured":"P. E. Green. Fiber-optic Communication Networks. Prentice-Hall, 1992. 201, 201, 201"},{"key":"15_CR14","unstructured":"S. Khanna. A Polynomial Time Approximation Scheme for the SONET Ring Loading Problem. Bell Labs Tech. J., Spring, 1997. 202, 203, 208, 211, 212"},{"key":"15_CR15","first-page":"202","volume":"33","author":"H. A. Kierstead","year":"1981","unstructured":"H. A. Kierstead and W. T. Trotter. An extremal problem in recursive combinatorics. Congressus Numerantium, 33, 1981. 202","journal-title":"Congressus Numerantium"},{"key":"15_CR16","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1007\/BF01215349","volume":"14","author":"T. Leighton","year":"1994","unstructured":"T. Leighton, B. Maggs, and S. Rao. Packet routing and jobshop scheduling in O(congestion+dilation) steps. Combinatorica, 14, 1994. 202","journal-title":"Combinatorica"},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"P. Raghavan and E. Upfal. Efficient Routing in All-Optical Networks. In Proc. of the 26th Annual Symposium on the Theory of Computing, 1994. 201, 202","DOI":"10.1145\/195058.195119"},{"key":"15_CR18","doi-asserted-by":"crossref","unstructured":"A. Schrijver, P. Seymour, and P. Winkler. The Ring Loading Problem. SIAM J. on Discrete Math., 11, 1998. 202, 202, 202, 203, 212","DOI":"10.1137\/S0895480195294994"},{"key":"15_CR19","unstructured":"G. Wilfong and P. Winkler. Ring Routing and Wavelength Translation. In Proc. of the European Symposium on Algorithms, pages 333\u2013341, 1998. 202, 203, 208, 209, 209, 212"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46691-6_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,13]],"date-time":"2023-05-13T18:56:34Z","timestamp":1684004194000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46691-6_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540668367","9783540466918"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-46691-6_15","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}