{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:04:35Z","timestamp":1763467475597,"version":"build-2065373602"},"reference-count":30,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1999,6,1]],"date-time":"1999-06-01T00:00:00Z","timestamp":928195200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1999,6,1]],"date-time":"1999-06-01T00:00:00Z","timestamp":928195200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5160,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1999,6]]},"DOI":"10.1016\/s0304-3975(99)00025-0","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T15:40:02Z","timestamp":1049730002000},"page":"19-39","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":15,"title":["Ondashline routing in all-optical networks"],"prefix":"10.1016","volume":"221","author":[{"given":"Yair","family":"Bartal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefano","family":"Leonardi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(99)00025-0_bib1","series-title":"Proc. 5th Annual ACM-SIAM Symp. on Discrete Algorithms","first-page":"412","article-title":"Efficient routing and scheduling algorithms for optical networks","author":"Aggarwal","year":"1994"},{"key":"10.1016\/S0304-3975(99)00025-0_bib2","series-title":"Proc. 25th Annual ACM Symp. on Theory of Computing","first-page":"623","article-title":"Ondashline load balancing with applications to machine scheduling and virtual circuit routing","author":"Aspnes","year":"1993"},{"key":"10.1016\/S0304-3975(99)00025-0_bib3","series-title":"Proc. 6th ACM-SIAM Symp. on Discrete Algorithms","first-page":"567","article-title":"Improved bounds for all-optical routing","author":"Aumann","year":"1995"},{"key":"10.1016\/S0304-3975(99)00025-0_bib4","series-title":"Proc. 4th Annual European Symp. on Algorithms","first-page":"431","article-title":"Ondashline competitive algorithms for call admission in optical networks","volume":"vol. 1136","author":"Awerbuch","year":"1996"},{"key":"10.1016\/S0304-3975(99)00025-0_bib5","series-title":"Proc. 34th Annual Symp. on Foundations of Computer Science","first-page":"32","article-title":"Throughput competitive ondashline routing","author":"Awerbuch","year":"1993"},{"key":"10.1016\/S0304-3975(99)00025-0_bib6","series-title":"Proc. SODA'94, Proc. 5th ACM-SIAM Symp. on Discrete Algorithms","first-page":"312","article-title":"Competitive nondashpreemptive call control","author":"Awerbuch","year":"1994"},{"key":"10.1016\/S0304-3975(99)00025-0_bib7","series-title":"Proc. 35th IEEE Annual Symp. on Foundations of Computer Science","first-page":"412","article-title":"Ondashline admission control and circuit routing for high performance computing and communication","author":"Awerbuch","year":"1994"},{"key":"10.1016\/S0304-3975(99)00025-0_bib8","first-page":"114","article-title":"Bounds on the Number of Wavelengths Needed in WDM Networks","author":"Barry","year":"1992"},{"key":"10.1016\/S0304-3975(99)00025-0_bib9","first-page":"567","article-title":"On the number of wavelengths and switches in all-optical networks","author":"Barry","year":"1994","journal-title":"IEEE Trans. Commun."},{"key":"10.1016\/S0304-3975(99)00025-0_bib10","series-title":"Proc. 28th ACM Symp. on Theory of Computing","first-page":"531","article-title":"Lower bounds for ondashline graph problems with application to ondashline circuit and optical routing","author":"Bartal","year":"1996"},{"key":"10.1016\/S0304-3975(99)00025-0_bib11","unstructured":"A. Borodin, J. Kleinberg, M. Sudan, Personal communication."},{"key":"10.1016\/S0304-3975(99)00025-0_bib12","series-title":"Proc. ICC '97","article-title":"Dynamic wavelength allocation in WDM ring networks","author":"Gerstel","year":"1997"},{"key":"10.1016\/S0304-3975(99)00025-0_bib13","series-title":"Proc. 34th Allerton Conf. on Communication, Control and Computation","article-title":"Dynamic channel assignment for WDM optical networks with little or no wavelength conversion","author":"Gerstel","year":"1996"},{"year":"1992","series-title":"Fiber-Optic Communication Networks","author":"Green","key":"10.1016\/S0304-3975(99)00025-0_bib14"},{"key":"10.1016\/S0304-3975(99)00025-0_bib15","series-title":"Proc. 31st IEEE Annual Symp. on Foundations of Computer Science","first-page":"470","article-title":"Coloring inductive graphs ondashline","author":"Irani","year":"1990"},{"key":"10.1016\/S0304-3975(99)00025-0_bib16","series-title":"Proc. 4th Annual European Symp. on Algorithms","first-page":"460","article-title":"Efficient wavelength routing in directed fiber trees","volume":"vol. 1136","author":"Kaklamanis","year":"1996"},{"key":"10.1016\/S0304-3975(99)00025-0_bib17","series-title":"Proc. 24th Int. Colloquium on Automata, Languages and Programming","first-page":"493","article-title":"Constrained bipartite edge coloring with applications to wavelength routing","author":"Kaklamanis","year":"1997"},{"issue":"4","key":"10.1016\/S0304-3975(99)00025-0_bib18","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1137\/0401048","article-title":"The linearity of first-fit coloring of interval graphs","volume":"1","author":"Kierstead","year":"1988","journal-title":"Siam J. Discrete Math."},{"key":"10.1016\/S0304-3975(99)00025-0_bib19","first-page":"143","article-title":"An extremal problem in recursive combinatorics","volume":"33","author":"Kierstead","year":"1981"},{"key":"10.1016\/S0304-3975(99)00025-0_bib20","series-title":"Proc. 36th IEEE Annual Symp. on Foundations of Computer Science","first-page":"52","article-title":"Disjoint paths in densely embedded graphs","author":"Kleinberg","year":"1995"},{"key":"10.1016\/S0304-3975(99)00025-0_bib21","series-title":"Proc. 8th ACM-SIAM Symp. on Discrete Algorithms","first-page":"437","article-title":"Improved access to optical bandwidth in trees","author":"Kumar","year":"1997"},{"volume":"Vol. A","year":"1990","series-title":"Algorithms and Complexity","key":"10.1016\/S0304-3975(99)00025-0_bib22"},{"key":"10.1016\/S0304-3975(99)00025-0_bib23","series-title":"Proc. of the 36th IEEE Annual Symp. on Foundations of Computer Science","first-page":"548","article-title":"Efficient access to pptical bandwidth","author":"Mihail","year":"1995"},{"article-title":"Architectures for linear light-wave networks","year":"1992","author":"Pankaj","key":"10.1016\/S0304-3975(99)00025-0_bib24"},{"key":"10.1016\/S0304-3975(99)00025-0_bib25","doi-asserted-by":"crossref","DOI":"10.1109\/90.251896","article-title":"A linear lightwave benes network","author":"Pieris","year":"1993","journal-title":"IEEE\/ACM Trans. Networking"},{"key":"10.1016\/S0304-3975(99)00025-0_bib26","series-title":"Proc. 37th Annual Symp. on Foundations of Computer Science","first-page":"400","article-title":"Path-coloring on the mesh","author":"Rabani","year":"1996"},{"key":"10.1016\/S0304-3975(99)00025-0_bib27","series-title":"Proc. 26th Annual Symp. on Theory of Computing","first-page":"133","article-title":"Efficient routing in all-optical networks","author":"Raghavan","year":"1994"},{"key":"10.1016\/S0304-3975(99)00025-0_bib28","doi-asserted-by":"crossref","unstructured":"M.\u015alusarek, Optimal online coloring of circular arc graphs, RAIRO J. Inform. Theor. Appl. 29 (5) 423\u2013429.","DOI":"10.1051\/ita\/1995290504231"},{"key":"10.1016\/S0304-3975(99)00025-0_bib29","doi-asserted-by":"crossref","DOI":"10.1145\/2786.2793","article-title":"Amortized efficiency of list update and paging rules","volume":"28","author":"Sleator","year":"1985","journal-title":"Communi. ACM"},{"key":"10.1016\/S0304-3975(99)00025-0_bib30","series-title":"Proc. 17th Annual Symp. on Foundations of Computer Science","first-page":"222","article-title":"Probabilistic computations: towards a unified measure of complexity","author":"Yao","year":"1977"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599000250?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599000250?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T00:51:43Z","timestamp":1759625503000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599000250"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,6]]},"references-count":30,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1999,6]]}},"alternative-id":["S0304397599000250"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00025-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[1999,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Ondashline routing in all-optical networks","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0304-3975(99)00025-0","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1999 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}