{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:34:54Z","timestamp":1725550494784},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540296737"},{"type":"electronic","value":"9783540320913"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11573036_6","type":"book-chapter","created":{"date-parts":[[2005,10,24]],"date-time":"2005-10-24T06:06:19Z","timestamp":1130133979000},"page":"57-67","source":"Crossref","is-referenced-by-count":0,"title":["Routing and Wavelength Assignment in Generalized WDM Tree Networks of Bounded Degree"],"prefix":"10.1007","author":[{"given":"Stratis","family":"Ioannidis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christos","family":"Nomikos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aris","family":"Pagourtzis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stathis","family":"Zachos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-540-27836-8_14","volume-title":"Automata, Languages and Programming","author":"M. Andrews","year":"2004","unstructured":"Andrews, M., Zhang, L.: Wavelength Assignment in Optical Networks with Fixed Fiber Capacity. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 134\u2013145. Springer, Heidelberg (2004)"},{"doi-asserted-by":"crossref","unstructured":"Andrews, M., Zhang, L.: Bounds on fiber minimization in optical networks with fixed fiber capacity. In: Proc. INFOCOM 2005 (2005)","key":"6_CR2","DOI":"10.1109\/INFCOM.2005.1497910"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0166-218X(93)E0174-W","volume":"59","author":"M.C. Carlisle","year":"1995","unstructured":"Carlisle, M.C., Lloyd, E.L.: On the k-coloring of intervals. Discrete Applied Mathematics\u00a059, 225\u2013235 (1995)","journal-title":"Discrete Applied Mathematics"},{"unstructured":"Carpenter, T., Cosares, S., Saniee, I.: Demand routing and slotting on ring networks. Technical Report 97-02, 28 (1997)","key":"6_CR4"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/978-3-540-48413-4_22","volume-title":"Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques","author":"C.C.T. Cheng","year":"1999","unstructured":"Cheng, C.C.T.: A new approximation algorithm for the demand routing and slotting problem with unit demands on rings. In: Hochbaum, D.S., Jansen, K., Rolim, J.D.P., Sinclair, A. (eds.) RANDOM 1999 and APPROX 1999. LNCS, vol.\u00a01671, pp. 209\u2013220. Springer, Heidelberg (1999)"},{"issue":"1","key":"6_CR6","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1109\/50.818901","volume":"18","author":"A.L. Chiu","year":"2000","unstructured":"Chiu, A.L., Modiano, E.: Traffic grooming algorithms for reducing electronic multiplexing costs in WDM ring networks. Journal of Lightwave Technology\u00a018(1), 2\u201312 (2000)","journal-title":"Journal of Lightwave Technology"},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1145\/781027.781066","volume-title":"Proc. of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems","author":"R. Dutta","year":"2003","unstructured":"Dutta, R., Huang, S., Rouskas, G.N.: Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms. In: Proc. of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, pp. 298\u2013299. ACM Press, New York (2003)"},{"unstructured":"Erlebach, T.: Scheduling Connections in Fast Networks. PhD thesis, Technische Universit\u00e4t M\u00fcnchen (1999)","key":"6_CR8"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/3-540-49381-6_20","volume-title":"Algorithms and Computation","author":"T. Erlebach","year":"1998","unstructured":"Erlebach, T., Jansen, K.: Maximizing the number of connections in optical tree networks. In: Chwa, K.-Y., Ibarra, O.H. (eds.) ISAAC 1998. LNCS, vol.\u00a01533, pp. 179\u2013188. Springer, Heidelberg (1998)"},{"issue":"1-2","key":"6_CR10","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/S0304-3975(99)00152-8","volume":"255","author":"T. Erlebach","year":"2001","unstructured":"Erlebach, T., Jansen, K.: The complexity of path coloring and call scheduling. Theoretical Computer Science\u00a0255(1-2), 33\u201350 (2001)","journal-title":"Theoretical Computer Science"},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/S0304-3975(99)00029-8","volume":"221","author":"T. Erlebach","year":"1999","unstructured":"Erlebach, T., Jansen, K., Kaklamanis, C., Mihail, M., Persiano, P.: Optimal wavelength routing in directed fiber trees. Theoretical Computer Science\u00a0221, 119\u2013137 (1999)","journal-title":"Theoretical Computer Science"},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-540-39890-5_19","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"T. Erlebach","year":"2003","unstructured":"Erlebach, T., Pagourtzis, A., Potika, K., Stefanakos, S.: Resource allocation problems in multifiber WDM tree networks. In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol.\u00a02880, pp. 218\u2013229. Springer, Heidelberg (2003)"},{"issue":"2","key":"6_CR13","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1137\/0601025","volume":"1","author":"M.R. Garey","year":"1980","unstructured":"Garey, M.R., Johnson, D.S., Miller, G.L., Papadimitriou, C.: The complexity of coloring circular arcs and chords. SIAM Journal of Algorithms and Discrete Mathematics\u00a01(2), 216\u2013227 (1980)","journal-title":"SIAM Journal of Algorithms and Discrete Mathematics"},{"issue":"1","key":"6_CR14","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1016\/0095-8956(85)90088-7","volume":"38","author":"M.C. Golumbic","year":"1985","unstructured":"Golumbic, M.C., Jamison, R.E.: The edge intersection graphs of paths in a tree. J. Comb. Theory Series B\u00a038(1), 8\u201322 (1985)","journal-title":"J. Comb. Theory Series B"},{"key":"6_CR15","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0196-6774(86)90039-8","volume":"7","author":"D.S. Hochbaum","year":"1986","unstructured":"Hochbaum, D.S., Nishizeki, T., Shmoys, D.B.: A better than\u201cbest possible\u201d algorithm to edge color multigraphs. Journal of Algorithms\u00a07, 79\u2013104 (1986)","journal-title":"Journal of Algorithms"},{"issue":"4","key":"6_CR16","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1137\/0210055","volume":"10","author":"I. Holyer","year":"1981","unstructured":"Holyer, I.: The NP-completeness of edge coloring. SIAM Journal on Computing\u00a010(4), 718\u2013720 (1981)","journal-title":"SIAM Journal on Computing"},{"issue":"5","key":"6_CR17","first-page":"306","volume":"70","author":"I.A. Karapetian","year":"1980","unstructured":"Karapetian, I.A.: On the coloring of circular arc graphs. Docladi (Reports) of the Academy of Science of the Armenian Soviet Socialist Republic\u00a070(5), 306\u2013311 (1980) (in Russian)","journal-title":"Docladi (Reports) of the Academy of Science of the Armenian Soviet Socialist Republic"},{"issue":"6","key":"6_CR18","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/S0020-0190(97)00077-X","volume":"62","author":"S.R. Kumar","year":"1997","unstructured":"Kumar, S.R., Panigrahy, R., Russel, A., Sundaram, R.: A note on optical routing on trees. Information Processing Letters\u00a062(6), 295\u2013300 (1997)","journal-title":"Information Processing Letters"},{"unstructured":"Kumar, V.: Bandwidth Allocation Algorithms for All-Optical Networks. PhD thesis, Northwestern University, Evanston, Illinois (1997)","key":"6_CR19"},{"key":"6_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BFb0053971","volume-title":"Approximation Algorithms for Combinatorial Optimization","author":"V. Kumar","year":"1998","unstructured":"Kumar, V.: Approximating circular arc colouring and bandwidth allocation in all-optical ring networks. In: Jansen, K., Rolim, J.D.P. (eds.) APPROX 1998. LNCS, vol.\u00a01444, p. 147. Springer, Heidelberg (1998)"},{"key":"6_CR21","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"H.W. Lenstra Jr.","year":"1983","unstructured":"Lenstra Jr., H.W.: Integer programming with a fixed number of variables. Math. Oper. Res.\u00a08, 538\u2013548 (1983)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"6_CR22","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1109\/90.909024","volume":"9","author":"G. Li","year":"2001","unstructured":"Li, G., Simha, R.: On the wavelength assignment problem in multifiber WDM star and ring networks. IEEE\/ACM Transactions on Networking\u00a09(1), 60\u201368 (2001)","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"6_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"768","DOI":"10.1007\/3-540-45022-X_64","volume-title":"Automata, Languages and Programming","author":"L. Margara","year":"2000","unstructured":"Margara, L., Simon, J.: Wavelength assignment problem on all-optical networks with k fibres per link. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol.\u00a01853, pp. 768\u2013779. Springer, Heidelberg (2000)"},{"unstructured":"Mihail, M., Kaklamanis, C., Rao, S.: Efficient access to optical bandwidth. In: Proc. IEEE Symp. Foundations of Computer Science, Milwaukee, Wisconsin, pp. 548\u2013557 (1995)","key":"6_CR24"},{"issue":"3","key":"6_CR25","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1137\/0403035","volume":"3","author":"T. Nishizeki","year":"1990","unstructured":"Nishizeki, T., Kashiwagi, K.: On the 1.1 edge-coloring of multigraphs. SIAM J. Disc. Math.\u00a03(3), 391\u2013410 (1990)","journal-title":"SIAM J. Disc. Math."},{"unstructured":"Nomikos, C.: Path Coloring in Graphs. PhD thesis, National Technical University of Athens, Athens (1997)","key":"6_CR26"},{"key":"6_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-540-24693-0_13","volume-title":"NETWORKING 2004. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications","author":"C. Nomikos","year":"2004","unstructured":"Nomikos, C., Pagourtzis, A., Potika, K., Zachos, S.: Fiber cost reduction and wavelength minimization in multifiber WDM networks. In: Mitrou, N.M., Kontovasilis, K., Rouskas, G.N., Iliadis, I., Merakos, L. (eds.) NETWORKING 2004. LNCS, vol.\u00a03042, pp. 150\u2013161. Springer, Heidelberg (2004)"},{"issue":"5","key":"6_CR28","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/S0020-0190(01)00167-3","volume":"80","author":"C. Nomikos","year":"2001","unstructured":"Nomikos, C., Pagourtzis, A., Zachos, S.: Routing and path multicoloring. Information Processing Letters\u00a080(5), 249\u2013256 (2001)","journal-title":"Information Processing Letters"},{"doi-asserted-by":"crossref","unstructured":"Nomikos, C., Pagourtzis, A., Zachos, S.: Minimizing request blocking in all-optical rings. In: Proc. INFOCOM 2003 (2003)","key":"6_CR29","DOI":"10.1109\/INFCOM.2003.1208971"},{"issue":"1","key":"6_CR30","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/S1389-1286(02)00448-6","volume":"42","author":"C. Nomikos","year":"2003","unstructured":"Nomikos, C., Pagourtzis, A., Zachos, S.: Satisfying a maximum number of pre-routed requests in all-optical rings. Computer Networks: The International Journal of Computer and Telecommunications Networking\u00a042(1), 55\u201363 (2003)","journal-title":"Computer Networks: The International Journal of Computer and Telecommunications Networking"},{"key":"6_CR31","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0020-0190(91)90245-D","volume":"37","author":"S. Olariu","year":"1991","unstructured":"Olariu, S.: An optimal greedy heuristic to color interval graphs. Information Processing Letters\u00a037, 21\u201325 (1991)","journal-title":"Information Processing Letters"},{"doi-asserted-by":"crossref","unstructured":"Raghavan, P., Upfal, E.: Efficient routing in all-optical networks. In: Proceedings of the Annual ACM Symposium on Theory of Computing, STOC 1994, pp. 134\u2013143 (1994)","key":"6_CR32","DOI":"10.1145\/195058.195119"},{"unstructured":"Shih, W.K., Hsu, W.L.: An approximation algorithm for coloring circular-arc graphs. In: SIAM Conference on Discrete Mathematics (1990)","key":"6_CR33"},{"doi-asserted-by":"crossref","unstructured":"Wan, P.-J., Liu, L.: Maximal throughput in wavelength-routed optical networks. In: Multichannel Optical Networks: Theory and Practice. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a046, pp. 15\u201326. AMS (1998)","key":"6_CR34","DOI":"10.1090\/dimacs\/046\/02"},{"unstructured":"Winkler, P., Zhang, L.: Wavelength assignment and generalized interval graph coloring. In: Proc. of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, Baltimore, MD, January 2003, pp. 830\u2013831 (2003)","key":"6_CR35"}],"container-title":["Lecture Notes in Computer Science","Advances in Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11573036_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T02:41:03Z","timestamp":1619491263000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11573036_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540296737","9783540320913"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/11573036_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}