{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T14:05:36Z","timestamp":1761401136725},"reference-count":23,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Networks"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s1389-1286(02)00448-6","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:19:33Z","timestamp":1049735973000},"page":"55-63","source":"Crossref","is-referenced-by-count":12,"title":["Satisfying a maximum number of pre-routed requests in all-optical rings"],"prefix":"10.1016","volume":"42","author":[{"given":"Christos","family":"Nomikos","sequence":"first","affiliation":[]},{"given":"Aris","family":"Pagourtzis","sequence":"additional","affiliation":[]},{"given":"Stathis","family":"Zachos","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1389-1286(02)00448-6_BIB1","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0166-218X(93)E0174-W","article-title":"On the k-coloring of intervals","volume":"59","author":"Carlisle","year":"1995","journal-title":"Discrete App. Math."},{"key":"10.1016\/S1389-1286(02)00448-6_BIB2","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1287\/mnsc.23.8.789","article-title":"Location of bank accounts to optimize float","volume":"23","author":"Cornuejols","year":"1977","journal-title":"Manage. Sci."},{"key":"10.1016\/S1389-1286(02)00448-6_BIB3","unstructured":"T. Erlebach, Scheduling connections in fast networks, Ph.D. Thesis, Technische Universit\u00e4t M\u00fcnchen, May 1999"},{"key":"10.1016\/S1389-1286(02)00448-6_BIB4","series-title":"Proc. ISAAC\u201998","first-page":"179","article-title":"Maximizing the number of connections in optical tree networks","volume":"vol. 1533","author":"Erlebach","year":"1998"},{"issue":"1\u20132","key":"10.1016\/S1389-1286(02)00448-6_BIB5","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/S0304-3975(99)00029-8","article-title":"Optimal wavelength routing on directed fiber trees","volume":"221","author":"Erlebach","year":"1999","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"10.1016\/S1389-1286(02)00448-6_BIB6","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1137\/0601025","article-title":"The complexity of coloring circular arcs and chords","volume":"1","author":"Garey","year":"1980","journal-title":"SIAM J. Alg. Disc. Math."},{"key":"10.1016\/S1389-1286(02)00448-6_BIB7","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0020-0190(91)90165-E","article-title":"Linear time algorithms for circular arc graphs and circle graphs","volume":"40","author":"Hsu","year":"1991","journal-title":"Inform. Process. Lett."},{"issue":"5","key":"10.1016\/S1389-1286(02)00448-6_BIB8","first-page":"306","article-title":"On the coloring of circular arc graphs","volume":"70","author":"Karapetian","year":"1980","journal-title":"Dock. Rep. Acad. Sci. Arm. Sov. Soc. Rep."},{"key":"10.1016\/S1389-1286(02)00448-6_BIB9","doi-asserted-by":"crossref","unstructured":"G. Li, R. Simha, On the wavelength assignment problem in multifiber WDM star and ring networks, in: Proceedings of INFOCOM 2000","DOI":"10.1117\/12.402532"},{"key":"10.1016\/S1389-1286(02)00448-6_BIB10","doi-asserted-by":"crossref","unstructured":"T.H. Ma, J.P. Spinrad, Avoiding matrix multiplication, in: 16th Workshop on Graph Theory, LNCS, vol. 484, Springer, Berlin, 1990, pp. 61\u201371","DOI":"10.1007\/3-540-53832-1_31"},{"key":"10.1016\/S1389-1286(02)00448-6_BIB11","doi-asserted-by":"crossref","unstructured":"L. Margara, J. Simon, Wavelength assignment problem on all-optical networks with k fibres per link, in: Proceedings of ICALP 2000, pp. 768\u2013779","DOI":"10.1007\/3-540-45022-X_64"},{"key":"10.1016\/S1389-1286(02)00448-6_BIB12","doi-asserted-by":"crossref","unstructured":"L. Margara, J. Simon, Decidable properties of all-optical networks, in: Proceedings of ICALP 2001, LNCS, vol. 2076, Springer, Berlin, 2001, pp. 518\u2013529","DOI":"10.1007\/3-540-48224-5_43"},{"key":"10.1016\/S1389-1286(02)00448-6_BIB13","unstructured":"M. Mihail, C. Kaklamanis, S. Rao, Efficient access to optical bandwidth, in: Proceedings of the 36th Annual Symposium on Foundations of Computer Science FOCS 1995, pp. 548\u2013557"},{"key":"10.1016\/S1389-1286(02)00448-6_BIB14","doi-asserted-by":"crossref","unstructured":"C. Nomikos, Routing and path coloring in rings: NP-completeness, Technical Report 15-2000, University of Ioannina, 2000","DOI":"10.1142\/9789812793928_0019"},{"key":"10.1016\/S1389-1286(02)00448-6_BIB15","unstructured":"C. Nomikos, Path coloring in graphs, Ph.D. Thesis, Department of Electrical and Computer Engineering, NTUA, 1997"},{"key":"10.1016\/S1389-1286(02)00448-6_BIB16","unstructured":"C. Nomikos, S. Zachos, Coloring a Maximum number of paths in a graph, in: ICALP Satellite workshop on Algorithmic Aspects of Communication, Bologna, July 11\u201312, 1997"},{"issue":"5","key":"10.1016\/S1389-1286(02)00448-6_BIB17","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/S0020-0190(01)00167-3","article-title":"Routing and path multi-coloring","volume":"80","author":"Nomikos","year":"2001","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S1389-1286(02)00448-6_BIB18","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0020-0190(91)90245-D","article-title":"An optimal greedy heuristic to color interval graphs","volume":"37","author":"Olariu","year":"1991","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S1389-1286(02)00448-6_BIB19","doi-asserted-by":"crossref","unstructured":"P. Raghavan, E. Upfal, Efficient routing in all-optical networks, in: Proceedings of the 26th Annual ACM Symposium on the Theory of Computing STOC 1994, pp. 134\u2013143","DOI":"10.1145\/195058.195119"},{"issue":"6","key":"10.1016\/S1389-1286(02)00448-6_BIB20","doi-asserted-by":"crossref","first-page":"744","DOI":"10.1109\/90.748086","article-title":"Multiwavelength optical networks with limited wavelength conversion","volume":"6","author":"Ramaswami","year":"1998","journal-title":"IEEE\/ACM Trans. Network."},{"key":"10.1016\/S1389-1286(02)00448-6_BIB21","doi-asserted-by":"crossref","unstructured":"V. Sharma, E.A. Varvarigos, Limited wavelength translation in all-optical WDM mesh networks, in: Proc. INFOCOM\u201998, April 1998, pp. 893\u2013901","DOI":"10.1109\/INFCOM.1998.665114"},{"issue":"7","key":"10.1016\/S1389-1286(02)00448-6_BIB22","doi-asserted-by":"crossref","first-page":"754","DOI":"10.1109\/90.803388","article-title":"On optimal converter placement in wavelength-routed networks","volume":"5","author":"Subramaniam","year":"1999","journal-title":"IEEE\/ACM Trans. Network."},{"key":"10.1016\/S1389-1286(02)00448-6_BIB23","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1090\/dimacs\/046\/02","article-title":"Maximal throughput in wavelength-routed optical networks","volume":"46","author":"Wan","year":"1998","journal-title":"DIMACS Ser. Discrete Math. Theoret. Comput. Sci."}],"container-title":["Computer Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1389128602004486?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1389128602004486?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,12]],"date-time":"2020-03-12T02:28:51Z","timestamp":1583980131000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1389128602004486"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S1389128602004486"],"URL":"https:\/\/doi.org\/10.1016\/s1389-1286(02)00448-6","relation":{},"ISSN":["1389-1286"],"issn-type":[{"value":"1389-1286","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}