{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T04:04:25Z","timestamp":1742961865160,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031498145"},{"type":"electronic","value":"9783031498152"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-49815-2_3","type":"book-chapter","created":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T07:02:28Z","timestamp":1703142148000},"page":"29-44","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Approximating Maximum Edge 2-Coloring by\u00a0Normalizing Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2509-6972","authenticated-orcid":false,"given":"Tobias","family":"M\u00f6mke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7123-1880","authenticated-orcid":false,"given":"Alexandru","family":"Popa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-3607-9611","authenticated-orcid":false,"given":"Aida","family":"Roshany-Tabrizi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-1968-4821","authenticated-orcid":false,"given":"Michael","family":"Ruderer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5997-6564","authenticated-orcid":false,"given":"Roland","family":"Vincze","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,22]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jda.2016.09.003","volume":"38\u201341","author":"A Adamaszek","year":"2016","unstructured":"Adamaszek, A., Popa, A.: Approximation and hardness results for the maximum edge Q-coloring problem. J. Discrete Algorithms 38\u201341, 1\u20138 (2016)","journal-title":"J. Discrete Algorithms"},{"key":"3_CR2","first-page":"311","volume":"73","author":"M Axenovich","year":"2004","unstructured":"Axenovich, M., Jiang, T.: Anti-Ramsey numbers for small complete bipartite graphs. Ars Comb. 73, 311\u2013318 (2004)","journal-title":"Ars Comb."},{"issue":"1","key":"3_CR3","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1002\/jgt.20012","volume":"47","author":"M Axenovich","year":"2004","unstructured":"Axenovich, M., Jiang, T., K\u00fcndgen, A.: Bipartite anti-Ramsey numbers of cycles. J. Graph Theory 47(1), 9\u201328 (2004)","journal-title":"J. Graph Theory"},{"issue":"1","key":"3_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jctb.2000.2016","volume":"82","author":"A Blokhuis","year":"2001","unstructured":"Blokhuis, A., Faudree, R.J., Gy\u00e1rf\u00e1s, A., Ruszink\u00f3, M.: Anti-Ramsey colorings in several rounds. J. Comb. Theory. Ser. B 82(1), 1\u201318 (2001)","journal-title":"J. Comb. Theory. Ser. B"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.dam.2021.05.017","volume":"319","author":"LS Chandran","year":"2021","unstructured":"Chandran, L.S., Lahiri, A., Singh, N.: Improved approximation for maximum edge colouring problem. Discret. Appl. Math. 319, 42\u201352 (2021)","journal-title":"Discret. Appl. Math."},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Chandran, L.S., Hashim, T., Jacob, D., Mathew, R., Rajendraprasad, D., Singh, N.: New bounds on the anti-Ramsey numbers of star graphs (2023)","DOI":"10.1016\/j.disc.2024.113894"},{"issue":"10","key":"3_CR7","doi-asserted-by":"publisher","first-page":"3370","DOI":"10.1016\/j.disc.2008.10.002","volume":"309","author":"H Chen","year":"2009","unstructured":"Chen, H., Li, X., Tu, J.: Complete solution for the rainbow numbers of matchings. Discrete Math. 309(10), 3370\u20133380 (2009)","journal-title":"Discrete Math."},{"key":"3_CR8","unstructured":"Erd\u0151s, P., Simonovits, M., S\u00f3s, V.T.: Anti-Ramsey theorems. Infinite and finite sets (Colloq., Keszthely, 1973; dedicated to P. Erd\u0151s on his 60th birthday), Vol. II, 633\u2013643. In: Colloquia Mathematica Societatis J\u00e1nos Bolyai, vol. 10 (1975)"},{"key":"3_CR9","unstructured":"Feng, W., Chen, P., Zhang, B.: Approximate maximum edge coloring within factor 2: a further analysis. In: ISORA, pp. 182\u2013189 (2008)"},{"key":"3_CR10","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":"3_CR11","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":"1","key":"3_CR12","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0012-365X(93)90054-W","volume":"118","author":"A Frieze","year":"1993","unstructured":"Frieze, A., Reed, B.: Polychromatic Hamilton cycles. Discrete Math. 118(1), 69\u201374 (1993)","journal-title":"Discrete Math."},{"issue":"5","key":"3_CR13","doi-asserted-by":"publisher","first-page":"933","DOI":"10.1016\/j.disc.2011.10.017","volume":"312","author":"R Haas","year":"2012","unstructured":"Haas, R., Young, M.: The anti-Ramsey number of perfect matching. Discrete Math. 312(5), 933\u2013937 (2012)","journal-title":"Discrete Math."},{"issue":"2","key":"3_CR14","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s003730200022","volume":"18","author":"T Jiang","year":"2002","unstructured":"Jiang, T.: Edge-colorings with no large polychromatic stars. Graphs Combin. 18(2), 303\u2013308 (2002)","journal-title":"Graphs Combin."},{"issue":"1\u20133","key":"3_CR15","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.disc.2003.09.002","volume":"274","author":"T Jiang","year":"2004","unstructured":"Jiang, T., West, D.B.: Edge-colorings of complete graphs that avoid polychromatic trees. Discrete Math. 274(1\u20133), 137\u2013145 (2004)","journal-title":"Discrete Math."},{"issue":"1","key":"3_CR16","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."},{"key":"3_CR17","first-page":"257","volume":"17","author":"M Las Vergnas","year":"1975","unstructured":"Las Vergnas, M.: A note on matchings in graphs. Cah. Cent. \u00c9tud. Rech. Op\u00e9r. 17, 257\u2013260 (1975)","journal-title":"Cah. Cent. \u00c9tud. Rech. Op\u00e9r."},{"key":"3_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1007\/978-3-319-94776-1_55","volume-title":"Computing and Combinatorics","author":"RS Mincu","year":"2018","unstructured":"Mincu, R.S., Popa, A.: Heuristic algorithms for the min-max edge 2-coloring problem. In: Wang, L., Zhu, D. (eds.) COCOON 2018. LNCS, vol. 10976, pp. 662\u2013674. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94776-1_55"},{"issue":"3","key":"3_CR19","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s00373-005-0619-y","volume":"21","author":"JJ Montellano-Ballesteros","year":"2005","unstructured":"Montellano-Ballesteros, J.J., Neumann-Lara, V.: An anti-Ramsey theorem on cycles. Graphs Combin. 21(3), 343\u2013354 (2005)","journal-title":"Graphs Combin."},{"issue":"1","key":"3_CR20","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF02392606","volume":"15","author":"J Petersen","year":"1891","unstructured":"Petersen, J.: Die theorie der regul\u00e4ren graphs. Acta Math. 15(1), 193\u2013220 (1891)","journal-title":"Acta Math."},{"key":"3_CR21","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 2005, vol. 3, pp. 2223\u20132234 (2005)","DOI":"10.1109\/INFCOM.2005.1498497"},{"issue":"2","key":"3_CR22","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."},{"issue":"1\u20132","key":"3_CR23","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/j.disc.2003.11.057","volume":"286","author":"I Schiermeyer","year":"2004","unstructured":"Schiermeyer, I.: Rainbow numbers for matchings and complete graphs. Discrete Math. 286(1\u20132), 157\u2013162 (2004)","journal-title":"Discrete Math."},{"key":"3_CR24","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1090\/S0002-9939-1974-0323648-6","volume":"42","author":"DP Sumner","year":"1974","unstructured":"Sumner, D.P.: Graphs with $$1$$-factors. Proc. Amer. Math. Soc. 42, 8\u201312 (1974)","journal-title":"Proc. Amer. Math. Soc."}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49815-2_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,6]],"date-time":"2024-11-06T14:46:47Z","timestamp":1730904407000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49815-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031498145","9783031498152"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49815-2_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"22 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Approximation and Online Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Amsterdam","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waoa2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo-conference.org\/2023\/waoa\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"37% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.05","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7.7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}