{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:32:45Z","timestamp":1725564765068},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540204527"},{"type":"electronic","value":"9783540398905"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39890-5_19","type":"book-chapter","created":{"date-parts":[[2010,9,3]],"date-time":"2010-09-03T21:16:57Z","timestamp":1283548617000},"page":"218-229","source":"Crossref","is-referenced-by-count":17,"title":["Resource Allocation Problems in Multifiber WDM Tree Networks"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Erlebach","sequence":"first","affiliation":[]},{"given":"Aris","family":"Pagourtzis","sequence":"additional","affiliation":[]},{"given":"Katerina","family":"Potika","sequence":"additional","affiliation":[]},{"given":"Stamatis","family":"Stefanakos","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"19_CR1","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s00453-001-0039-1","volume":"31","author":"B. Awerbuch","year":"2001","unstructured":"Awerbuch, B., Azar, Y., Fiat, A., Leonardi, S., Ros\u00e9n, A.: On-line competitive algorithms for call admission in optical networks. Algorithmica\u00a031(1), 29\u201343 (2001)","journal-title":"Algorithmica"},{"key":"19_CR2","unstructured":"Awerbuch, B., Bartal, Y., Fiat, A., Ros\u00e9n, A.: Competitive non-preemptive call control. In: Proceedings of the 5th Annual ACM\u2013SIAM Symposium on Discrete Algorithms (SODA 1994), pp. 312\u2013320 (1994)"},{"key":"19_CR3","unstructured":"Beauquier, B., Bermond, J.-C., Gargano, L., Hell, P., Perennes, S., Vaccaro, U.: Graph problems arising fromwavelength-routing in all-optical networks. In: Proceedings of IPPS 1997, Second Workshop on Optics and Computer Science, WOCS (1997)"},{"key":"19_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/3-540-45061-0_34","volume-title":"Automata, Languages and Programming","author":"C. Chekuri","year":"2003","unstructured":"Chekuri, C., Mydlarz, M., Shepherd, F.: Multicommodity demand flow in a tree. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 410\u2013425. Springer, Heidelberg (2003)"},{"issue":"1","key":"19_CR5","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s004930170002","volume":"21","author":"R. Cole","year":"2001","unstructured":"Cole, R., Ost, K., Schirra, S.: Edge-coloring bipartite multigraphs in O(E logD) time. Combinatorica\u00a021(1), 5\u201312 (2001)","journal-title":"Combinatorica"},{"key":"19_CR6","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":"19_CR7","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":"19_CR8","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":"19_CR9","doi-asserted-by":"crossref","unstructured":"Erlebach, T., Pagourtzis, A., Potika, K., Stefanakos, S.: Resource allocation problems in multifiber WDM tree networks. TIK-Report 178, Computer Engineering and Networks Laboratory (TIK), ETH Z\u00fcrich (August 2003)","DOI":"10.1007\/978-3-540-39890-5_19"},{"key":"19_CR10","unstructured":"Ferreira, A., Perennes, S., Richa, A., Rivano, H., Stier, N.: On the design of multifiber WDM networks. In: Proc. AlgoTel 2002, M\u00e8ze, France, May 2002, pp. 25\u201332 (2002)"},{"issue":"1","key":"19_CR11","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(1), 3\u201320 (1997)","journal-title":"Algorithmica"},{"key":"19_CR12","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1007\/978-1-4757-6048-4_45","volume-title":"Numbers, Information and Complexity","author":"L. Gargano","year":"2000","unstructured":"Gargano, L., Vaccaro, U.: Routing in all-optical networks: Algorithmic and graph-theoretic problems. In: Alth\u00f6fer, I., et al. (eds.) Numbers, Information and Complexity, pp. 555\u2013578. Kluwer Academic Publishers, Dordrecht (2000)"},{"issue":"1","key":"19_CR13","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":"19_CR14","volume-title":"Fiber Optic Networks","author":"P.E. Green","year":"1993","unstructured":"Green, P.E.: Fiber Optic Networks. Prentice Hall, Englewood Cliffs (1993)"},{"key":"19_CR15","unstructured":"Klasing, R.: Methods and problems of wavelength-routing in all-optical networks. Technical Report CS-RR-348, Department of Computer Science, University of Warwick, Presented as invited talk at the MFCS 1998 Workshop on Communications (September 1998)"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Li, G., Simha, R.: Onthewavelength assignment problem in multifiber optical tree networks. In: Terabit Optical Networking: Architecture, Control, and Management Issues, number 4213 in Proceedings of SPIE, November 2000, pp. 84\u201391 (2000)","DOI":"10.1117\/12.402532"},{"issue":"1","key":"19_CR17","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":"19_CR18","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)"},{"key":"19_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1007\/3-540-48224-5_43","volume-title":"Automata, Languages and Programming","author":"L. Margara","year":"2001","unstructured":"Margara, L., Simon, J.: Decidable properties of graphs of all-optical networks. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, pp. 518\u2013529. Springer, Heidelberg (2001)"},{"key":"19_CR20","unstructured":"Nomikos, C., Pagourtzis, A., Potika, K., Zachos, S.: Path multi-coloring in weighted graphs. In: Proceedings of the 8th Panhellenic Conference on Informatics, Nicosia, Cyprus, November 2001, vol.\u00a0I, pp. 178\u2013186 (2001)"},{"key":"19_CR21","doi-asserted-by":"crossref","unstructured":"Nomikos, C., Pagourtzis, A., Potika, K., Zachos, S.: Fiber cost reduction and wavelength minimization in multifiber WDM networks (2003) (manuscript)","DOI":"10.1007\/978-3-540-24693-0_13"},{"issue":"5","key":"19_CR22","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"},{"key":"19_CR23","doi-asserted-by":"crossref","unstructured":"Raghavan, P., Upfal, E.: Efficient routing in all-optical networks. In: Proceedings of the 26th Annual ACM Symposium on Theory of Computing (STOC 1994), pp. 134\u2013143 (1994)","DOI":"10.1145\/195058.195119"},{"issue":"5","key":"19_CR24","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1109\/90.469957","volume":"3","author":"R. Ramaswami","year":"1995","unstructured":"Ramaswami, R., Sivarajan, K.N.: Routing and wavelength assignment in all-optical networks. IEEE\/ACM Transactions on Networking\u00a03(5), 489\u2013500 (1995)","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"19_CR25","series-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1090\/dimacs\/046\/02","volume-title":"Multichannel Optical Networks: Theory and Practice","author":"P.-J. Wan","year":"1998","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, Providence (1998)"},{"key":"19_CR26","unstructured":"Winkler, P., Zhang, L.: Wavelength assignment and generalized interval graph coloring. In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2003), pp. 830\u2013831 (2003)"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39890-5_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T09:19:29Z","timestamp":1559553569000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39890-5_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540204527","9783540398905"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39890-5_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}