{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T12:57:49Z","timestamp":1742993869017,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319196619"},{"type":"electronic","value":"9783319196626"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-19662-6_3","type":"book-chapter","created":{"date-parts":[[2015,6,18]],"date-time":"2015-06-18T15:56:53Z","timestamp":1434643013000},"page":"33-47","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Scheduling Connections via Path and Edge Multicoloring"],"prefix":"10.1007","author":[{"given":"Evangelos","family":"Bampas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christina","family":"Karousatou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aris","family":"Pagourtzis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Katerina","family":"Potika","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,19]]},"reference":[{"issue":"1","key":"3_CR1","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/j.jcss.2005.08.001","volume":"72","author":"M Andrews","year":"2006","unstructured":"Andrews, M., Zhang, L.: Minimizing maximum fiber requirement in optical networks. J. Comput. Syst. Sci. 72(1), 118\u2013131 (2006). http:\/\/dx.doi.org\/10.1016\/j.jcss.2005.08.001","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"3_CR2","doi-asserted-by":"publisher","first-page":"1125","DOI":"10.1109\/TNET.2011.2173948","volume":"20","author":"E Bampas","year":"2012","unstructured":"Bampas, E., Pagourtzis, A., Pierrakos, G., Potika, K.: On a noncooperative model for wavelength assignment in multifiber optical networks. IEEE\/ACM Trans. Netw. 20(4), 1125\u20131137 (2012)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-642-38233-8_3","volume-title":"Algorithms and Complexity","author":"E Bampas","year":"2013","unstructured":"Bampas, E., Pagourtzis, A., Pierrakos, G., Syrgkanis, V.: Selfish resource allocation in optical networks. In: Spirakis, P.G., Serna, M. (eds.) CIAC 2013. LNCS, vol. 7878, pp. 25\u201336. Springer, Heidelberg (2013). http:\/\/dx.doi.org\/10.1007\/978-3-642-38233-8"},{"key":"3_CR4","unstructured":"Barrett, C.L., Kumar, V.S.A., Marathe, M.V., Thite, S., Istrate, G.: Strong edge coloring for channel assignment in wireless radio networks. In: 4th IEEE Conference on Pervasive Computing and Communications Workshops (PerCom 2006 Workshops), 13\u201317 March 2006, Pisa, Italy, pp. 106\u2013110. IEEE Computer Society (2006). http:\/\/doi.ieeecomputersociety.org\/10.1109\/PERCOMW.2006.129"},{"issue":"1","key":"3_CR5","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1002\/net.20345","volume":"56","author":"Z Bian","year":"2010","unstructured":"Bian, Z., Gu, Q.P.: Wavelength assignment in multifiber star networks. Networks 56(1), 30\u201338 (2010)","journal-title":"Networks"},{"key":"3_CR6","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.B.: Multicommodity demand flow in a tree. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 410\u2013425. Springer, Heidelberg (2003)"},{"key":"3_CR7","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. 1533, p. 179. Springer, Heidelberg (1998)"},{"issue":"1\u20132","key":"3_CR8","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. Theor. Comput. Sci. 255(1\u20132), 33\u201350 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR9","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.K.: Resource allocation problems in multifiber WDM tree networks. In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol. 2880, pp. 218\u2013229. Springer, Heidelberg (2003)"},{"issue":"4","key":"3_CR10","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/BF00998632","volume":"5","author":"HN Gabow","year":"1976","unstructured":"Gabow, H.N.: Using Euler partitions to edge color bipartite multigraphs. Int. J. Comput. Inf. Sci. 5(4), 345\u2013355 (1976)","journal-title":"Int. J. Comput. Inf. Sci."},{"issue":"1","key":"3_CR11","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1016\/0095-8956(85)90088-7","volume":"38","author":"MC Golumbic","year":"1985","unstructured":"Golumbic, M.C., Jamison, R.E.: The edge intersection graphs of paths in a tree. J. Comb. Theory Ser. B 38(1), 8\u201322 (1985)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"2","key":"3_CR12","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1145\/322248.322254","volume":"28","author":"GH Gonnet","year":"1981","unstructured":"Gonnet, G.H.: Expected length of the longest probe sequence in hash code searching. J. ACM 28(2), 289\u2013304 (1981)","journal-title":"J. ACM"},{"issue":"4","key":"3_CR13","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-colouring. SIAM J. Comput. 10(4), 718\u2013720 (1981)","journal-title":"SIAM J. Comput."},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Hsu, C., Liu, P., Wang, D., Wu, J.: Generalized edge coloring for channel assignment in wireless networks. In: 2006 International Conference on Parallel Processing (ICPP 2006), 14\u201318 August 2006, Columbus, Ohio, USA, pp. 82\u201392. IEEE Computer Society (2006). http:\/\/dx.doi.org\/10.1109\/ICPP.2006.45","DOI":"10.1109\/ICPP.2006.45"},{"issue":"3","key":"3_CR15","doi-asserted-by":"publisher","first-page":"744","DOI":"10.1137\/0214054","volume":"14","author":"EG Coffman Jr","year":"1985","unstructured":"Coffman Jr., E.G., Garey, M.R., Johnson, D.S., LaPaugh, A.S.: Scheduling file transfers. SIAM J. Comput. 14(3), 744\u2013780 (1985). http:\/\/dx.doi.org\/10.1137\/0214054","journal-title":"SIAM J. Comput."},{"issue":"2","key":"3_CR16","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1109\/TNET.2008.926504","volume":"17","author":"P Kyasanur","year":"2009","unstructured":"Kyasanur, P., Vaidya, N.H.: Capacity of multichannel wireless networks under the protocol model. IEEE\/ACM Trans. Netw. 17(2), 515\u2013527 (2009). http:\/\/doi.acm.org\/10.1145\/1552193.1552205","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"1","key":"3_CR17","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0196-6774(83)90032-9","volume":"4","author":"D Leven","year":"1983","unstructured":"Leven, D., Galil, Z.: NP completeness of finding the chromatic index of regular graphs. J. Algorithms 4(1), 35\u201344 (1983)","journal-title":"J. Algorithms"},{"key":"3_CR18","unstructured":"Li, G., Simha, R.: On the wavelength assignment problem in multifiber WDM star and ring networks. In: INFOCOM, pp. 1771\u20131780 (2000). http:\/\/www.ieee-infocom.org\/2000\/papers\/222.ps"},{"key":"3_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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. 3042, pp. 150\u2013161. Springer, Heidelberg (2004)"},{"issue":"1","key":"3_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.comnet.2004.11.028","volume":"50","author":"C Nomikos","year":"2006","unstructured":"Nomikos, C., Pagourtzis, A., Potika, K., Zachos, S.: Routing and wavelength assignment in multifiber WDM networks with non-uniform fiber cost. Comput. Netw. 50(1), 1\u201314 (2006). http:\/\/dx.doi.org\/10.1016\/j.comnet.2004.11.028","journal-title":"Comput. Netw."},{"issue":"5","key":"3_CR21","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. Inf. Process. Lett. 80(5), 249\u2013256 (2001)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"3_CR22","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s00607-007-0234-2","volume":"80","author":"A Pagourtzis","year":"2007","unstructured":"Pagourtzis, A., Potika, K., Zachos, S.: Path multicoloring with fewer colors in spiders and caterpillars. Computing 80(3), 255\u2013274 (2007)","journal-title":"Computing"},{"key":"3_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1465","DOI":"10.1007\/11422778_139","volume-title":"NETWORKING 2005","author":"K Potika","year":"2005","unstructured":"Potika, K.: Maximizing the number of connections in multifiber WDM chain, ring and star networks. In: Boutaba, R., Almeroth, K.C., Puigjaner, R., Shen, S., Black, J.P. (eds.) NETWORKING 2005. LNCS, vol. 3462, pp. 1465\u20131470. Springer, Heidelberg (2005)"},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"Raghavan, P., Upfal, E.: Efficient routing in all-optical networks. In: Leighton, F.T., Goodrich, M.T. (eds.) STOC, pp. 134\u2013143. ACM (1994)","DOI":"10.1145\/195058.195119"},{"key":"3_CR25","unstructured":"Winkler, P., Zhang, L.: Wavelength assignment and generalized interval graph coloring. In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 12\u201314, 2003, Baltimore, Maryland, USA, pp. 830\u2013831. ACM\/SIAM (2003). http:\/\/dl.acm.org\/citation.cfm?id=644108.644246"}],"container-title":["Lecture Notes in Computer Science","Ad-hoc, Mobile, and Wireless Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-19662-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,9]],"date-time":"2024-06-09T15:52:48Z","timestamp":1717948368000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-19662-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319196619","9783319196626"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19662-6_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"19 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}