{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:01:16Z","timestamp":1725559276576},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540258094"},{"type":"electronic","value":"9783540320173"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11422778_139","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T20:01:28Z","timestamp":1279051288000},"page":"1465-1470","source":"Crossref","is-referenced-by-count":3,"title":["Maximizing the Number of Connections in Multifiber WDM Chain, Ring and Star Networks"],"prefix":"10.1007","author":[{"given":"Katerina","family":"Potika","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"139_CR1","doi-asserted-by":"publisher","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 prerouted requests in all-optical rings. Computer Networks\u00a042, 55\u201363 (2003)","journal-title":"Computer Networks"},{"key":"139_CR2","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)"},{"key":"139_CR3","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)"},{"key":"139_CR4","unstructured":"Saad, M., Luo, Z.: On the routing and wavelength assignement in multifiber WDM networks. In: Proceedings of Globecom 2002 (2002)"},{"key":"139_CR5","first-page":"75","volume":"4","author":"D. Li","year":"2003","unstructured":"Li, D., Jia, X., Hu, X., Gong, E.Z.: Wavelength assignment for minimizing system blockings in multifiber all-optical WDM networks. Optical Networks\u00a04, 75\u201381 (2003)","journal-title":"Optical Networks"},{"key":"139_CR6","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0166-218X(93)E0174-W","volume":"59","author":"M. Carlislie","year":"1995","unstructured":"Carlislie, M., Lloyd, E.: On the k-coloring of intervals. Discrete Applied Mathematics\u00a059, 225\u2013235 (1995)","journal-title":"Discrete Applied Mathematics"},{"key":"139_CR7","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, 249\u2013256 (2001)","journal-title":"Information Processing Letters"},{"key":"139_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"788","DOI":"10.1007\/3-540-45465-9_67","volume-title":"Automata, Languages and Programming","author":"U. Adamy","year":"2002","unstructured":"Adamy, U., Ambuehl, C., Anand, R.S., Erlebach, T.: Call control in rings. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 788\u2013799. Springer, Heidelberg (2002)"},{"key":"139_CR9","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF02523685","volume":"18","author":"N. Garg","year":"1997","unstructured":"Garg, N., Vazirani, V.V., Yannakakis, M.: Primal-dual approximation algorithms for integral flow and multicut in trees. Algorithmica\u00a018, 3\u201320 (1997)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","NETWORKING 2005. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11422778_139.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:04:19Z","timestamp":1619507059000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11422778_139"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540258094","9783540320173"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/11422778_139","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}