{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,24]],"date-time":"2026-09-24T03:37:10Z","timestamp":1790221030452,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2004,6,13]],"date-time":"2004-06-13T00:00:00Z","timestamp":1087084800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2004,6,13]]},"DOI":"10.1145\/1007352.1007417","type":"proceedings-article","created":{"date-parts":[[2004,7,20]],"date-time":"2004-07-20T15:55:38Z","timestamp":1090338938000},"page":"398-406","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["An approximate K\u00f6nig's theorem for edge-coloring weighted bipartite graphs"],"prefix":"10.1145","author":[{"given":"Jos\u00e9 R.","family":"Correa","sequence":"first","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michel X.","family":"Goemans","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2004,6,13]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Proceedings of the 12th Annual International Symposium on Computer Architecture, 108--115","author":"Beetem J.","year":"1985","unstructured":"J. Beetem , M. Denneau & D. Weingarten , \"The GF11 supercomputer,\" In Proceedings of the 12th Annual International Symposium on Computer Architecture, 108--115 , 1985 .]] J. Beetem, M. Denneau & D. Weingarten, \"The GF11 supercomputer,\" In Proceedings of the 12th Annual International Symposium on Computer Architecture, 108--115, 1985.]]"},{"key":"e_1_3_2_1_2_1","unstructured":"V. E. Benes \"Mathematical Theory of Connecting Networks and Telephone Traffic \" Academic Press New York 1965.]]  V. E. Benes \"Mathematical Theory of Connecting Networks and Telephone Traffic \" Academic Press New York 1965.]]"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(95)00030-U"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/0220046"},{"key":"e_1_3_2_1_5_1","first-page":"406","article-title":"A study of nonblocking switching networks","volume":"32","author":"Clos C.","year":"1953","unstructured":"C. Clos , \" A study of nonblocking switching networks ,\" Bell Systems Tech. Journal 32 , 406 -- 424 , 1953 .]] C. Clos, \"A study of nonblocking switching networks,\" Bell Systems Tech. Journal 32, 406--424, 1953.]]","journal-title":"Journal"},{"key":"e_1_3_2_1_6_1","unstructured":"J. R. Correa & M. X. Goemans in preparation.]]  J. R. Correa & M. X. Goemans in preparation.]]"},{"key":"e_1_3_2_1_7_1","first-page":"165","article-title":"On some combinatorial problems arising in scheduling","volume":"8","author":"de Werra D.","year":"1970","unstructured":"D. de Werra , \" On some combinatorial problems arising in scheduling ,\" Operations Research Society Journal 8 , 165 -- 175 , 1970 .]] D. de Werra, \"On some combinatorial problems arising in scheduling,\" Operations Research Society Journal 8, 165--175, 1970.]]","journal-title":"Operations Research Society Journal"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"R. Diestel \"Graph Theory \" Springer Verlag Graduate Texts in Mathematics 173 New York 1997.]]  R. Diestel \"Graph Theory \" Springer Verlag Graduate Texts in Mathematics 173 New York 1997.]]","DOI":"10.1007\/978-3-662-53622-3_7"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/299868.299876"},{"key":"e_1_3_2_1_10_1","first-page":"211","article-title":"Generalization of a theorem of K\u00f6nig","volume":"46","author":"Hoffman A. J.","year":"1956","unstructured":"A. J. Hoffman , \" Generalization of a theorem of K\u00f6nig ,\" Journal of the Washington Academy of Science 46 , 211 -- 212 , 1956 .]] A. J. Hoffman, \"Generalization of a theorem of K\u00f6nig,\" Journal of the Washington Academy of Science 46, 211--212, 1956.]]","journal-title":"Journal of the Washington Academy of Science"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/49.105174"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"N. Karmarkar \"Probabilistic analysis of some bin-packing algorithms \" In Proceedings of the 23rd Symposium on Foundations of Computer Science 107--111 1982.]]  N. Karmarkar \"Probabilistic analysis of some bin-packing algorithms \" In Proceedings of the 23rd Symposium on Foundations of Computer Science 107--111 1982.]]","DOI":"10.1109\/SFCS.1982.37"},{"key":"e_1_3_2_1_14_1","first-page":"104","article-title":"Graphok \u00e9s alkalmaz\u00e1suk a determin\u00e1nsok \u00e9s a halmazok elm\u00e9let\u00e9re","volume":"34","author":"K\u00f6nig D.","year":"1916","unstructured":"D. K\u00f6nig , \" Graphok \u00e9s alkalmaz\u00e1suk a determin\u00e1nsok \u00e9s a halmazok elm\u00e9let\u00e9re ,\" Mathematikai \u00e9s Term\u00e9szettudom\u00e1nyi \u00e9rtesit\u00f6 34 , 104 -- 119 , 1916 .]] D. K\u00f6nig, \"Graphok \u00e9s alkalmaz\u00e1suk a determin\u00e1nsok \u00e9s a halmazok elm\u00e9let\u00e9re,\" Mathematikai \u00e9s Term\u00e9szettudom\u00e1nyi \u00e9rtesit\u00f6 34, 104--119, 1916.]]","journal-title":"Mathematikai \u00e9s Term\u00e9szettudom\u00e1nyi \u00e9rtesit\u00f6"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796313921"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1090\/dimacs\/042\/19"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(84)90004-X"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/0218021"},{"key":"e_1_3_2_1_19_1","first-page":"834","article-title":"Multirate rearrangeable Clos networks and a generalized edge coloring problem on bipartite graphs","author":"Ngo H. Q.","year":"2003","unstructured":"H. Q. Ngo & V. H. Vu , \" Multirate rearrangeable Clos networks and a generalized edge coloring problem on bipartite graphs ,\" In Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003 ), 834 -- 840 , 2003.]] H. Q. Ngo & V. H. Vu, \"Multirate rearrangeable Clos networks and a generalized edge coloring problem on bipartite graphs,\" In Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003), 834--840, 2003.]]","journal-title":"Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.13.1.140"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/44483.44487"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/645590.659919"},{"key":"e_1_3_2_1_23_1","unstructured":"D. Slepian \"Two theorems on a particular crossbar switching \" unpublished manuscript 1958.]]  D. Slepian \"Two theorems on a particular crossbar switching \" unpublished manuscript 1958.]]"}],"event":{"name":"STOC04: Symposium of Theory of Computing 2004","location":"Chicago IL USA","acronym":"STOC04","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the thirty-sixth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1007352.1007417","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1007352.1007417","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T17:23:56Z","timestamp":1750267436000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1007352.1007417"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,6,13]]},"references-count":22,"alternative-id":["10.1145\/1007352.1007417","10.1145\/1007352"],"URL":"https:\/\/doi.org\/10.1145\/1007352.1007417","relation":{},"subject":[],"published":{"date-parts":[[2004,6,13]]},"assertion":[{"value":"2004-06-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}