{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T12:10:02Z","timestamp":1748434202715,"version":"3.41.0"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319193144"},{"type":"electronic","value":"9783319193151"}],"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-19315-1_20","type":"book-chapter","created":{"date-parts":[[2015,6,6]],"date-time":"2015-06-06T10:42:08Z","timestamp":1433587328000},"page":"226-237","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Min-max Edge q-Coloring Problem"],"prefix":"10.1007","author":[{"given":"Tommi","family":"Larjomaa","sequence":"first","affiliation":[]},{"given":"Alexandru","family":"Popa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,7]]},"reference":[{"key":"20_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-642-17514-5_12","volume-title":"Algorithms and Computation","author":"A Adamaszek","year":"2010","unstructured":"Adamaszek, A., Popa, A.: Approximation and hardness results for the maximum edge q-coloring problem. In: Cheong, O., Chwa, K.-Y., Park, K. (eds.) ISAAC 2010, Part II. LNCS, vol. 6507, pp. 132\u2013143. Springer, Heidelberg (2010)"},{"issue":"4","key":"20_CR2","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1016\/j.comnet.2004.12.001","volume":"47","author":"I Akyildiz","year":"2005","unstructured":"Akyildiz, I., Wang, X., Wang, W.: Wireless mesh networks: a survey. Comput. Netw. 47(4), 445\u2013487 (2005)","journal-title":"Comput. Netw."},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Draves, R., Padhye, J., Zill, B.: Routing in multi-radio, multi-hop wireless mesh networks. In: MobiCom 2004, pp. 114\u2013128. ACM (2004)","DOI":"10.1145\/1023720.1023732"},{"key":"20_CR4","unstructured":"Feng, W., Chen, P., Zhang, B.: Approximate maximum edge coloring within factor 2: a further analysis. In: ISORA, pp. 182\u2013189 (2008)"},{"key":"20_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"646","DOI":"10.1007\/978-3-540-72504-6_59","volume-title":"Theory and Applications of Models of Computation","author":"W Feng","year":"2007","unstructured":"Feng, W., Zhang, L., Qu, W., Wang, H.: Approximation algorithms for maximum edge coloring problem. In: Cai, J.-Y., Cooper, S.B., Zhu, H. (eds.) TAMC 2007. LNCS, vol. 4484, pp. 646\u2013658. Springer, Heidelberg (2007)"},{"issue":"11","key":"20_CR6","doi-asserted-by":"publisher","first-page":"1022","DOI":"10.1016\/j.tcs.2008.10.035","volume":"410","author":"W Feng","year":"2009","unstructured":"Feng, W., Zhang, L., Wang, H.: Approximation algorithm for maximum edge coloring. Theor. Comput. Sci. 410(11), 1022\u20131029 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Gupta, B., Acharya, B., Mishra, M.: Optimization of routing algorithm in wireless mesh networks. In: NaBIC 2009, pp. 1150\u20131155. IEEE (2009)","DOI":"10.1109\/NABIC.2009.5393819"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Kyasanur, P., Vaidya, N.: Routing and interface assignment in multi-channel multi-interface wireless networks. In: Proceedings of IEEE Wireless Communications and Networking Conference 2005, vol. 4, pp. 2051\u20132056. IEEE (2005)","DOI":"10.1109\/WCNC.2005.1424834"},{"key":"20_CR9","unstructured":"Larjomaa, T., Popa, A.: The min-max edge q-coloring problem. CoRR abs\/1302.3404 (2013)"},{"issue":"3","key":"20_CR10","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1137\/0209046","volume":"9","author":"R Lipton","year":"1980","unstructured":"Lipton, R., Tarjan, R.: Applications of a planar separator theorem. SIAM J. Comput. 9(3), 615\u2013627 (1980)","journal-title":"SIAM J. Comput."},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Muir, A., Garcia-Luma-Aceves, J.: A channel access protocol for multihop wireless networks with multiple channels. In: ICC 1998, vol. 3, pp. 1617\u20131621, June 1998","DOI":"10.1109\/ICC.1998.683102"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Raniwala, A., Chiueh, T.: Architecture and algorithms for an IEEE 802.11-based multi-channel wireless mesh network. In: INFOCOM, pp. 2223\u20132234. IEEE (2005)","DOI":"10.1109\/INFCOM.2005.1498497"},{"issue":"2","key":"20_CR13","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1145\/997122.997130","volume":"8","author":"A Raniwala","year":"2004","unstructured":"Raniwala, A., Gopalan, K., Chiueh, T.: Centralized channel assignment and routing algorithms for multi-channel wireless mesh networks. Mob. Comput. Commun. Rev. 8(2), 50\u201365 (2004)","journal-title":"Mob. Comput. Commun. Rev."},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Schaefer, T.: The complexity of satisfiability problems. In: STOC 1978, pp. 216\u2013226. ACM, New York (1978)","DOI":"10.1145\/800133.804350"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"So, J., Vaidya, N.: Multi-channel mac for ad hoc networks: handling multi-channel hidden terminals using a single transceiver. In: MobiHoc 2004, pp. 222\u2013233. ACM (2004)","DOI":"10.1145\/989459.989487"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-19315-1_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T11:46:24Z","timestamp":1748432784000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-19315-1_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319193144","9783319193151"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19315-1_20","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":"7 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}