{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T00:20:53Z","timestamp":1767140453964,"version":"build-2238731810"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,6,30]],"date-time":"2021-06-30T00:00:00Z","timestamp":1625011200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,6,30]],"date-time":"2021-06-30T00:00:00Z","timestamp":1625011200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["425297\/2016-0, 305264\/2016-8"],"award-info":[{"award-number":["425297\/2016-0, 305264\/2016-8"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005283","name":"Funda\u00e7\u00e3o Cearense de Apoio ao Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["PNE-0112-00061.01.00\/16"],"award-info":[{"award-number":["PNE-0112-00061.01.00\/16"]}],"id":[{"id":"10.13039\/501100005283","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005283","name":"Funda\u00e7\u00e3o Cearense de Apoio ao Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["PNE-0112-00061.01.00\/16"],"award-info":[{"award-number":["PNE-0112-00061.01.00\/16"]}],"id":[{"id":"10.13039\/501100005283","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1007\/s10479-021-04180-3","type":"journal-article","created":{"date-parts":[[2021,6,30]],"date-time":"2021-06-30T02:04:45Z","timestamp":1625018685000},"page":"1267-1278","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Using the minimum maximum flow degree to approximate the flow coloring problem"],"prefix":"10.1007","volume":"316","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2962-2033","authenticated-orcid":false,"given":"Manoel","family":"Camp\u00ealo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7915-6048","authenticated-orcid":false,"given":"Jhonata A. S.","family":"Matias","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,6,30]]},"reference":[{"key":"4180_CR1","volume-title":"Network flows: Theory, algorithms, and applications","author":"R Ahuja","year":"1993","unstructured":"Ahuja, R., Magnanti, T., & Orlin, J. (1993). Network flows: Theory, algorithms, and applications. London: Prentice Hall."},{"key":"4180_CR2","unstructured":"Camp\u00ealo, M., Corr\u00eaa, R., Huiban, C., Rodrigues, C.D. (2012): The flow coloring problem. In: Congreso Latino-Iberoamericano de Investigacion Operativa (CLAIO), pp. 3256\u20133267."},{"key":"4180_CR3","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.dam.2015.06.025","volume":"197","author":"M Camp\u00ealo","year":"2015","unstructured":"Camp\u00ealo, M., Huiban, C., Rodrigues, C. D., & Sampaio, R. M. (2015). On the complexity of the flow coloring problem. Discrete Applied Mathematics, 197, 75\u201392.","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"4180_CR4","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. (2001). Edge-coloring bipartite multigraphs in $${O} ({E} \\log {D})$$ time. Combinatorica, 21(1), 5\u201312.","journal-title":"Combinatorica"},{"issue":"1","key":"4180_CR5","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1002\/jgt.3190080115","volume":"8","author":"MK Goldberg","year":"1984","unstructured":"Goldberg, M. K. (1984). Edge-coloring of multigraphs: Recoloring technique. Journal of Graph Theory, 8(1), 123\u2013137.","journal-title":"Journal of Graph Theory"},{"key":"4180_CR6","unstructured":"Gomes, C. (2009): Radio mesh networks and the round weighting problem. Ph.D. thesis, Universit\u00e9 Nice Sophia Antipolis."},{"issue":"1","key":"4180_CR7","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0196-6774(86)90039-8","volume":"7","author":"DS Hochbaum","year":"1986","unstructured":"Hochbaum, D. S., Nishizeki, T., & Shmoys, D. B. (1986). A better than best possible algorithm to edge color multigraphs. Journal of Algorithms, 7(1), 79\u2013104.","journal-title":"Journal of Algorithms"},{"issue":"4","key":"4180_CR8","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1137\/0210055","volume":"10","author":"I Holyer","year":"1981","unstructured":"Holyer, I. (1981). The np-completeness of edge-coloring. SIAM Journal on Computing, 10(4), 718\u2013720.","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"4180_CR9","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/j.tcs.2008.06.048","volume":"406","author":"R Klasing","year":"2008","unstructured":"Klasing, R., Morales, N., & P\u00e9rennes, S. (2008). On the complexity of bandwidth allocation in radio networks. Theoretical Computer Science, 406(3), 225\u2013239.","journal-title":"Theoretical Computer Science"},{"key":"4180_CR10","unstructured":"Matias, J., Camp\u00ealo, M. (2018): M\u00e9todo exato para o problema de colora\u00e7\u00e3o de fluxo. In: Congreso Latino-Iberoamericano de Investigacion Operativa (CLAIO), pp. 1\u20138."},{"key":"4180_CR11","doi-asserted-by":"crossref","unstructured":"Orlin, J.B. (2013): Max flows in $$o(nm)$$ time, or better. In: Proceedings of the Forty-fifth Annual ACM Symposium on Theory of Computing, STOC \u201913, pp. 765\u2013774.","DOI":"10.1145\/2488608.2488705"},{"issue":"3","key":"4180_CR12","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1137\/S0097539796299266","volume":"28","author":"A Schrijver","year":"1998","unstructured":"Schrijver, A. (1998). Bipartite edge coloring in o($$\\delta $$m) time. SIAM Journal on Computing, 28(3), 841\u2013846.","journal-title":"SIAM Journal on Computing"},{"issue":"1\u20134","key":"4180_CR13","first-page":"148","volume":"28","author":"CE Shannon","year":"1949","unstructured":"Shannon, C. E. (1949). A theorem on coloring the lines of a network. Studies in Applied Mathematics, 28(1\u20134), 148\u2013152.","journal-title":"Studies in Applied Mathematics"}],"updated-by":[{"DOI":"10.1007\/s10479-022-04555-0","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2022,4,20]],"date-time":"2022-04-20T00:00:00Z","timestamp":1650412800000}}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-021-04180-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-021-04180-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-021-04180-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,5]],"date-time":"2022-10-05T09:49:20Z","timestamp":1664963360000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-021-04180-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,30]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["4180"],"URL":"https:\/\/doi.org\/10.1007\/s10479-021-04180-3","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6,30]]},"assertion":[{"value":"21 June 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 June 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 April 2022","order":3,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":4,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"A Correction to this paper has been published:","order":5,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1007\/s10479-022-04555-0","URL":"https:\/\/doi.org\/10.1007\/s10479-022-04555-0","order":6,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}}]}}