{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T12:40:10Z","timestamp":1751719210293,"version":"3.41.0"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319947754"},{"type":"electronic","value":"9783319947761"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-94776-1_55","type":"book-chapter","created":{"date-parts":[[2018,6,29]],"date-time":"2018-06-29T01:48:06Z","timestamp":1530236886000},"page":"662-674","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Heuristic Algorithms for the Min-Max Edge 2-Coloring Problem"],"prefix":"10.1007","author":[{"given":"Radu Stefan","family":"Mincu","sequence":"first","affiliation":[]},{"given":"Alexandru","family":"Popa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,6,29]]},"reference":[{"key":"55_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. LNCS, vol. 6507, pp. 132\u2013143. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17514-5_12"},{"key":"55_CR2","unstructured":"Feng, W., Chen, P., Zhang, B.: Approximate maximum edge coloring within factor 2: a further analysis. In: ISORA, pp. 182\u2013189 (2008)"},{"key":"55_CR3","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). https:\/\/doi.org\/10.1007\/978-3-540-72504-6_59"},{"issue":"11","key":"55_CR4","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."},{"issue":"4598","key":"55_CR5","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P., et al.: Optimization by simulated annealing. Science 220(4598), 671\u2013680 (1983)","journal-title":"Science"},{"key":"55_CR6","doi-asserted-by":"crossref","unstructured":"Kyasanur, P., Vaidya, N.H.: Routing and interface assignment in multi-channel multi-interface wireless networks. In: 2005 IEEE Wireless Communications and Networking Conference, vol. 4, pp. 2051\u20132056. IEEE (2005)","DOI":"10.1109\/WCNC.2005.1424834"},{"key":"55_CR7","unstructured":"Larjomaa, T.: Improving bandwidth in wireless mesh networks. Master\u2019s thesis, School of Electrical Engineering, Aalto University, February 2013"},{"key":"55_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/978-3-319-19315-1_20","volume-title":"Combinatorial Algorithms","author":"T Larjomaa","year":"2015","unstructured":"Larjomaa, T., Popa, A.: The min-max edge q-coloring problem. In: Kratochv\u00edl, J., Miller, M., Froncek, D. (eds.) IWOCA 2014. LNCS, vol. 8986, pp. 226\u2013237. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-19315-1_20"},{"issue":"1","key":"55_CR9","doi-asserted-by":"publisher","first-page":"507","DOI":"10.7155\/jgaa.00373","volume":"19","author":"T Larjomaa","year":"2015","unstructured":"Larjomaa, T., Popa, A.: The min-max edge q-coloring problem. J. Graph Algorithms Appl. 19(1), 507\u2013528 (2015)","journal-title":"J. Graph Algorithms Appl."},{"issue":"3","key":"55_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":"55_CR11","doi-asserted-by":"crossref","unstructured":"Mincu, R.S.: Java implementation of heuristic algorithms for the maximum and min-max 2-coloring problems (2017). https:\/\/github.com\/radusm\/minmax","DOI":"10.1007\/978-3-319-94776-1_55"},{"key":"55_CR12","doi-asserted-by":"crossref","unstructured":"Muir, A., Garcia-Luma-Aceves, J.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":"55_CR13","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 (2005)","DOI":"10.1109\/INFCOM.2005.1498497"},{"issue":"2","key":"55_CR14","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. Mobile Comput. Commun. Rev. 8(2), 50\u201365 (2004)","journal-title":"Mobile Comput. Commun. Rev."},{"key":"55_CR15","doi-asserted-by":"crossref","unstructured":"So, J., Vaidya, N.H.: 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","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-94776-1_55","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T12:12:21Z","timestamp":1751717541000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-94776-1_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319947754","9783319947761"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94776-1_55","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"29 June 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Qing Dao","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 July 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon2018.sdu.edu.cn\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}