{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:29:07Z","timestamp":1725488947057},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540411833"},{"type":"electronic","value":"9783540400646"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-40064-8_3","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T04:25:42Z","timestamp":1186892742000},"page":"13-22","source":"Crossref","is-referenced-by-count":0,"title":["Approximating Call-Scheduling Makespan in All-Optical Networks"],"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":[[2002,7,18]]},"reference":[{"key":"3_CR1","unstructured":"Y. Aumann and Y. Rabani. Improved bounds for all-optical routing. In Proc. of the 6-th ACM Symposium on Discrete Algorithms, pages 567\u2013576, 1995."},{"key":"3_CR2","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, pages 531\u2013540, 1996.","DOI":"10.1145\/237814.238001"},{"key":"3_CR3","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, volume 1256 of Lectures Notes in Computer Science, pages 516\u2013526, 1997.","DOI":"10.1007\/3-540-63165-8_207"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"L. Becchetti, M. Di Ianni, and A. Marchetti-Spaccamela. Approximation Algorithms for Routing and Call Scheduling in all-optical Chains and Rings. In Proc. of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science, volume 1738 of Lectures Notes in Computer Science, pages 201\u2013212, 1999.","DOI":"10.1007\/3-540-46691-6_15"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"948","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:948\u2013964, 1990.","journal-title":"IEEE Journal Selected Areas in Comm."},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"J. Van Leeuwen editor. Handbook of Theoretical Computer Science. Volume A: Algorithms and Complexity. Elesevier North-Holland, Amsterdam, 1990.","DOI":"10.1016\/B978-0-444-88071-0.50015-1"},{"key":"3_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."},{"key":"3_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.","DOI":"10.1109\/HICSS.1997.667220"},{"key":"3_CR9","series-title":"Lect Notes Comput Sci","volume-title":"Off-line and on-line call-scheduling in stars and trees","author":"T. Erlebach","year":"1997","unstructured":"T. Erlebach and K. Jansen. Off-line and on-line call-scheduling in stars and trees. In WG: Graph-Theoretic Concepts in Computer Science, International Workshop WG, volume 1335 of Lecture Notes in Computer Science, 1997."},{"issue":"1-2","key":"3_CR10","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/S0304-3975(99)00029-8","volume":"221","author":"T. Erlebach","year":"1999","unstructured":"T. Erlebach, K. Jansen, C. Kaklamanis, M. Mihail, and P. Persiano. Optimal Wavelength Routing on Directed Fiber Tree. Theoretical Computer Science, 221(1-2):119\u2013137, 1999.","journal-title":"Theoretical Computer Science"},{"key":"3_CR11","unstructured":"P. E. Green. Fiber-optic Communication Networks. Prentice-Hall, 1992."},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/S0304-3975(97)00198-9","volume":"196","author":"M. Ianni Di","year":"1998","unstructured":"M. Di Ianni. Efficient delay routing. Theoretical Computer Science, 196:131\u2013151, 1998.","journal-title":"Theoretical Computer Science"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"S. Khanna. A Polynomial Time Approximation Scheme for the SONET Ring Loading Problem. Bell Labs Tech. J., Spring, 1997.","DOI":"10.1002\/bltj.2047"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"J. Kleinberg and E. Tardos. Approximations for the disjoint paths problem in high-diameter planar networks. In Proc. of 27th ACM Symposium on the Theory Of Computing, pages 26\u201335, 1995.","DOI":"10.1145\/225058.225075"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"F.T. Leighton, B.M. Maggs, and A.W. Richa. Fast Algorithms for Finding O(Congestion+Dilation) Packet Routing Schedules. In Proc. of 28th Annual Hawaii International Conference on System Sciences, pages 555\u2013563, 1995.","DOI":"10.1109\/HICSS.1995.375501"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"T. Leighton, B. Maggs, and S. Rao. Packet routing and jobshop scheduling in O(congestion+dilation) steps. Combinatorica, 14, 1994.","DOI":"10.1007\/BF01215349"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"K. Nosu N. K. Cheung and G. Winzer. Dense Wavelength Division Multiplexing Networks: Principles and Applications. IEEE Journal Selected Areas in Comm., 8, 1990.","DOI":"10.1109\/49.57798"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Y. Rabani. Path coloring on the mesh. In Proc. of 37th Annual IEEE Symposium Foundations of Computer Science, pages 400\u2013409, 1996.","DOI":"10.1109\/SFCS.1996.548499"},{"key":"3_CR19","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, pages 134\u2013143, 1994.","DOI":"10.1145\/195058.195119"},{"issue":"6","key":"3_CR20","doi-asserted-by":"publisher","first-page":"1313","DOI":"10.1137\/S0097539793248317","volume":"24","author":"D. B. Shmoys","year":"1995","unstructured":"D. B. Shmoys, J. Wein, and D. P. Williamson. Scheduling parallel machines on-line. SIAM Journal of Computing, 24 (6):1313\u20131331, 1995.","journal-title":"SIAM Journal of Computing"},{"key":"3_CR21","unstructured":"B. Zelinka. Medians and Peripherians on Trees. Arch. Math. (Brno), pages 87\u201395, 1969."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-40064-8_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T23:39:55Z","timestamp":1556753995000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-40064-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540411833","9783540400646"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-40064-8_3","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}