{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,25]],"date-time":"2023-04-25T07:33:14Z","timestamp":1682407994991},"reference-count":23,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,9,1]],"date-time":"2002-09-01T00:00:00Z","timestamp":1030838400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3972,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2002,9]]},"DOI":"10.1016\/s0304-3975(01)00255-9","type":"journal-article","created":{"date-parts":[[2002,10,9]],"date-time":"2002-10-09T15:39:34Z","timestamp":1034177974000},"page":"429-448","source":"Crossref","is-referenced-by-count":5,"title":["Approximation algorithms for routing and call scheduling in all-optical chains and rings"],"prefix":"10.1016","volume":"287","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":"78","reference":[{"key":"10.1016\/S0304-3975(01)00255-9_BIB1","series-title":"Network Flows","author":"Ahuja","year":"1993"},{"key":"10.1016\/S0304-3975(01)00255-9_BIB2","unstructured":"Y. Aumann, Y. Rabani, Improved bounds for all optical routing, Proceedings of the fifth Annual ACM\u2013SIAM Symposium on Discrete Algorithms, 1994."},{"key":"10.1016\/S0304-3975(01)00255-9_BIB3","doi-asserted-by":"crossref","unstructured":"B. Awerbuch, Y. Azar, A. Fiat, S. Leonardi, A. Rosen, On-line competitive algorithms for call admission in optical networks, Proceedings of the fourth Annual European Symposium on Algorithms, 1996.","DOI":"10.1007\/3-540-61680-2_73"},{"key":"10.1016\/S0304-3975(01)00255-9_BIB4","doi-asserted-by":"crossref","unstructured":"Y. Bartal, A. Fiat, S. Leonardi, Lower bounds for on-line graph problems with application to on-line circuit and optical-routing, Proceedings of the twenty-eighth Annual Symposium on the Theory of Computing, 1996.","DOI":"10.1145\/237814.238001"},{"key":"10.1016\/S0304-3975(01)00255-9_BIB5","unstructured":"L. Becchetti, Efficient Resource Management in High Bandwidth Networks, Ph.D. Thesis, Dipartimento di Informatica e Sistemistica, University of Rome \u201cLa Sapienza\u201d, 1998."},{"key":"10.1016\/S0304-3975(01)00255-9_BIB6","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/S0304-3975(98)00018-8","article-title":"Efficient collective communication in optical networks","volume":"233","author":"Bermond","year":"2000","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00255-9_BIB7","doi-asserted-by":"crossref","first-page":"948","DOI":"10.1109\/49.57798","article-title":"Dense wavelength division multiplexing networks","volume":"8","author":"Brackett","year":"1990","journal-title":"IEEE J. Selected Areas Comm."},{"key":"10.1016\/S0304-3975(01)00255-9_BIB8","unstructured":"T. Erlebach, K. Jansen, Scheduling virtual connections in fast networks, Proceedings of the fourth Parallel Systems and Algorithms Workshop PASA \u201996, 1996."},{"key":"10.1016\/S0304-3975(01)00255-9_BIB9","doi-asserted-by":"crossref","unstructured":"T. Erlebach, K. Jansen, Call scheduling in trees, rings and meshes, Proceedings of the thirtieth Hawaii International Conference on System Sciences, 1997.","DOI":"10.1109\/HICSS.1997.667220"},{"key":"10.1016\/S0304-3975(01)00255-9_BIB10","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/S0304-3975(99)00029-8","article-title":"Optimal wavelength routing on directed fiber tree Technical Report","volume":"221","author":"Erlebach","year":"1999","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00255-9_BIB11","unstructured":"A. Feldmann, On-line call admission for high-speed networks (Ph.D. Thesis), Technical Report CMU-CS-95-201, School of Computer Science, Carnegie Mellon University, 1995."},{"key":"10.1016\/S0304-3975(01)00255-9_BIB12","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/S0304-3975(01)00255-9_BIB13","doi-asserted-by":"crossref","unstructured":"J. Gergov, Approximation algorithms for dynamic storage allocation, Proceedings of the fourth Annual European Symposium on Algorithms, 1996.","DOI":"10.1007\/3-540-61680-2_46"},{"key":"10.1016\/S0304-3975(01)00255-9_BIB14","unstructured":"J. Gergov, Algorithms for compile-time memory optimization, Proceedings of the ninth ACM\u2013SIAM Symposium on Discrete Algorithms, 1999."},{"key":"10.1016\/S0304-3975(01)00255-9_BIB15","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1137\/0117039","article-title":"Bounds for multiprocessing timing anomalies","volume":"17","author":"Graham","year":"1969","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0304-3975(01)00255-9_BIB16","series-title":"Fiber-Optic Communication Networks","author":"Green","year":"1992"},{"key":"10.1016\/S0304-3975(01)00255-9_BIB17","unstructured":"S. Khanna, A polynomial time approximation scheme for the SONET ring loading problem, Bell Labs Tech. J. Springer, 1997."},{"key":"10.1016\/S0304-3975(01)00255-9_BIB18","article-title":"An extremal problem in recursive combinatorics","volume":"33","author":"Kierstead","year":"1981","journal-title":"Congr. Numer."},{"key":"10.1016\/S0304-3975(01)00255-9_BIB19","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BF01215349","article-title":"Packet routing and jobshop scheduling in O(congestion+dilation) steps","volume":"14","author":"Leighton","year":"1994","journal-title":"Combinatorica"},{"key":"10.1016\/S0304-3975(01)00255-9_BIB20","article-title":"Dense wavelength division multiplexing networks","volume":"8","author":"Nosu","year":"1990","journal-title":"IEEE J. Selected Areas in Comm."},{"key":"10.1016\/S0304-3975(01)00255-9_BIB21","doi-asserted-by":"crossref","unstructured":"P. Raghavan, E. Upfal, Efficient routing in all-optical networks, Proceedings of the twenty-sixth Annual Symposium on the Theory of Computing, 1994.","DOI":"10.1145\/195058.195119"},{"key":"10.1016\/S0304-3975(01)00255-9_BIB22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/S0895480195294994","article-title":"The ring loading problem","volume":"11","author":"Schrijver","year":"1998","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0304-3975(01)00255-9_BIB23","unstructured":"G. Wilfong, P. Winkler, Ring routing and wavelength translation, Proceedings of the European Symposium on Algorithms, 1998, pp. 333\u2013341."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501002559?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501002559?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T03:38:58Z","timestamp":1554781138000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501002559"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,9]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,9]]}},"alternative-id":["S0304397501002559"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00255-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,9]]}}}