{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:47:12Z","timestamp":1725565632354},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540219590"},{"type":"electronic","value":"9783540246930"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24693-0_13","type":"book-chapter","created":{"date-parts":[[2010,9,11]],"date-time":"2010-09-11T02:02:45Z","timestamp":1284170565000},"page":"150-161","source":"Crossref","is-referenced-by-count":9,"title":["Fiber Cost Reduction and Wavelength Minimization in Multifiber WDM Networks"],"prefix":"10.1007","author":[{"given":"Christos","family":"Nomikos","sequence":"first","affiliation":[]},{"given":"Aris","family":"Pagourtzis","sequence":"additional","affiliation":[]},{"given":"Katerina","family":"Potika","sequence":"additional","affiliation":[]},{"given":"Stathis","family":"Zachos","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","first-page":"410","volume-title":"Proc. Automata, Languages and Programming 30th International Colloquium, ICALP 2003","author":"C Chekuri","year":"2003","unstructured":"C. Chekuri, M. Mydlarz, and F. B. Shepherd. Multicommodity demand flow in a tree. In Proc. Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, pages 410\u2013425, 2003."},{"issue":"1","key":"13_CR2","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1109\/50.818901","volume":"18","author":"AL Chiu","year":"2000","unstructured":"A. L. Chiu and E. Modiano. Traffic grooming algorithms for reducing electronic multiplexing costs in WDM ring networks. Journal of Lightwave Technology, 18(1):2\u201312, 2000.","journal-title":"Journal of Lightwave Technology"},{"issue":"1","key":"13_CR3","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s004930170002","volume":"21","author":"R Cole","year":"2001","unstructured":"R. Cole, K. Ost, and S. Schirra. Edge-coloring bipartite multigraphs in O(ElogD) time. Combinatorica, 21(1):5\u201312, 2001.","journal-title":"Combinatorica"},{"key":"13_CR4","first-page":"298","volume-title":"Proc. of the 2003 ACM SIGMETRICS","author":"R Dutta","year":"2003","unstructured":"R. Dutta, S. Huang, and G. N. Rouskas. Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms. In Proc. of the 2003 ACM SIGMETRICS, 2003, pages 298\u2013299. ACM Press."},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-540-39890-5_19","volume-title":"Proc. of the 29th Workshop on Graph Theoretic Concepts in Computer Science","author":"T Erlebach","year":"2003","unstructured":"T. Erlebach, A. Pagourtzis, K. Potika, and S. Stefanakos. Resource allocation problems in multifiber WDM tree networks. In Proc. of the 29th Workshop on Graph Theoretic Concepts in Computer Science, LNCS 2880, pages 218\u2013229, 2003."},{"issue":"(l)","key":"13_CR6","first-page":"60","volume":"9","author":"G Li","year":"2001","unstructured":"G. Li and R. Simha. On the wavelength assignment problem in multifiber WDM star and ring networks. IEEE\/ACM Transactions on Networking, 9(l):60\u201368, 2001.","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"768","DOI":"10.1007\/3-540-45022-X_64","volume-title":"Proc. Automata, Languages and Programming","author":"L Margara","year":"2000","unstructured":"L. Margara and J. Simon. Wavelength assignment problem on all-optical networks with k fibres per link. In Proc. Automata, Languages and Programming, 27th International Colloquium, ICALP 2000, pages 768\u2013779, 2000."},{"key":"13_CR8","first-page":"178","volume-title":"Proc. of the 8th PCI, volume I","author":"C Nomikos","year":"2001","unstructured":"C. Nomikos, A. Pagourtzis, K. Potika, and S. Zachos. Path multi-coloring in weighted graphs. In Proc. of the 8th PCI, volume I, pages 178\u2013186, 2001."},{"issue":"5","key":"13_CR9","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/S0020-0190(01)00167-3","volume":"80","author":"C Nomikos","year":"2001","unstructured":"C. Nomikos, A. Pagourtzis, and S. Zachos. Routing and path multicoloring. Information Processing Letters, 80(5):249\u2013256, 2001.","journal-title":"Information Processing Letters"},{"key":"13_CR10","volume-title":"Proc. INFOCOM2003","author":"C Nomikos","year":"2003","unstructured":"C. Nomikos, A. Pagourtzis, and S. Zachos. Minimizing request blocking in all-optical rings. In Proc. INFOCOM2003, San Francisco, CA, 2003."},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1145\/195058.195119","volume-title":"Proc. of the twenty-sixth annual ACM STOC","author":"P Raghavan","year":"1994","unstructured":"P. Raghavan and E. Upfal. Efficient routing in all-optical networks. In Proc. of the twenty-sixth annual ACM STOC, pages 134\u2013143. ACM Press, 1994."},{"key":"13_CR12","first-page":"23","volume":"3","author":"V Vizing","year":"1964","unstructured":"V. Vizing. On an estimate of the chromatic class of a p-graph (in russian). Diskret. Analiz., 3:23\u201330, 1964.","journal-title":"Diskret. Analiz."},{"key":"13_CR13","first-page":"830","volume-title":"Proc. of the 14th Annual ACM-SIAM SODA","author":"P Winkler","year":"2003","unstructured":"P. Winkler and L. Zhang. Wavelength assignment and generalized interval graph coloring. In Proc. of the 14th Annual ACM-SIAM SODA, pages 830\u2013831, Baltimore, MD, January 2003."}],"container-title":["Lecture Notes in Computer Science","NETWORKING 2004. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24693-0_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:03:26Z","timestamp":1620011006000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24693-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540219590","9783540246930"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24693-0_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}