{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:10:38Z","timestamp":1750306238003,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T00:00:00Z","timestamp":1497830400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/M02797X\/1"],"award-info":[{"award-number":["EP\/M02797X\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003246","name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["Veni grant"],"award-info":[{"award-number":["Veni grant"]}],"id":[{"id":"10.13039\/501100003246","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,6,19]]},"DOI":"10.1145\/3055399.3055439","type":"proceedings-article","created":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T20:27:45Z","timestamp":1497558465000},"page":"100-111","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["A simpler and faster strongly polynomial algorithm for generalized flow maximization"],"prefix":"10.1145","author":[{"given":"Neil","family":"Olver","sequence":"first","affiliation":[{"name":"VU University Amsterdam, Netherlands \/ CWI, Netherlands"}]},{"given":"L\u00e1szl\u00f3 A.","family":"V\u00e9gh","sequence":"additional","affiliation":[{"name":"London School of Economics, UK"}]}],"member":"320","published-online":{"date-parts":[[2017,6,19]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"Ahuja R. K.","year":"1993","unstructured":"R. K. Ahuja , T. L. Magnanti , and J. B. Orlin . Network Flows: Theory, Algorithms, and Applications . Prentice-Hall, Inc. , feb 1993 . R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Inc., feb 1993."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/3119414.3119578"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374441"},{"key":"e_1_3_2_2_4_1","volume-title":"Linear Programming and Extensions","author":"Dantzig G. B.","year":"1963","unstructured":"G. B. Dantzig . Linear Programming and Extensions . Princeton University Press , Princeton , 1963 . G. B. Dantzig. Linear Programming and Extensions. Princeton University Press, Princeton, 1963."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/321694.321699"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s101070100238"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/28869.28874"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.16.2.351"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/76359.76368"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/2781835.2781837"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s101070100248"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/2786372.2786374"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-002-0333-y"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(03)00074-9"},{"key":"e_1_3_2_2_15_1","first-page":"68","volume-title":"Mathematical methods of organizing and planning production","author":"Kantorovich L. V.","year":"1939","unstructured":"L. V. Kantorovich . Mathematical methods of organizing and planning production . Publication House of the Leningrad State University, page 68 , 1939 . L. V. Kantorovich. Mathematical methods of organizing and planning production. Publication House of the Leningrad State University, page 68, 1939."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.6.4.366"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/3226661.3227036"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.52"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/0212022"},{"key":"e_1_3_2_2_20_1","volume-title":"A simpler and faster strongly polynomial algorithm for generalized flow maximization. Preprint, arXiv:1611.01778","author":"Olver N.","year":"2016","unstructured":"N. Olver and L. A. V\u00e9gh . A simpler and faster strongly polynomial algorithm for generalized flow maximization. Preprint, arXiv:1611.01778 , 2016 . N. Olver and L. A. V\u00e9gh. A simpler and faster strongly polynomial algorithm for generalized flow maximization. Preprint, arXiv:1611.01778, 2016."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCT.1966.1082612"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.41.2.338"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(03)00403-1"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-007-0183-8"},{"key":"e_1_3_2_2_26_1","volume-title":"Combinatorial optimization - Polyhedra and Efficiency","author":"Schrijver A.","year":"2003","unstructured":"A. Schrijver . Combinatorial optimization - Polyhedra and Efficiency . Springer , 2003 . A. Schrijver. Combinatorial optimization - Polyhedra and Efficiency. Springer, 2003."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579369"},{"key":"e_1_3_2_2_28_1","first-page":"256","volume-title":"Operations Research","year":"1986","unstructured":"\u00c9. Tardos. A strongly polynomial algorithm to solve combinatorial linear programs . Operations Research , pages 250\u2013 256 , 1986 . \u00c9. Tardos. A strongly polynomial algorithm to solve combinatorial linear programs. Operations Research, pages 250\u2013256, 1986."},{"key":"e_1_3_2_2_29_1","series-title":"Lecture Notes in Computer Science","first-page":"324","volume-title":"Proceedings of IPCO","author":"Wayne K. D.","year":"1998","unstructured":"\u00c9. Tardos and K. D. Wayne . Simple maximum flow algorithms in lossy networks . In Proceedings of IPCO , Lecture Notes in Computer Science , volume 1412 , pages 310\u2013 324 , 1998 . \u00c9. Tardos and K. D. Wayne. Simple maximum flow algorithms in lossy networks. In Proceedings of IPCO, Lecture Notes in Computer Science, volume 1412, pages 310\u2013324, 1998."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63499"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/3114198.3114682"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2013.0623"},{"key":"e_1_3_2_2_33_1","volume-title":"Mathematics of Operations Research","author":"V\u00e9gh L. A.","year":"2016","unstructured":"L. A. V\u00e9gh . A strongly polynomial algorithm for generalized flow maximization . Mathematics of Operations Research , 2016 . Articles in Advance. L. A. V\u00e9gh. A strongly polynomial algorithm for generalized flow maximization. Mathematics of Operations Research, 2016. Articles in Advance."},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.5555\/2786397.2786398"}],"event":{"name":"STOC '17: Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Montreal Canada","acronym":"STOC '17"},"container-title":["Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3055399.3055439","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3055399.3055439","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:23:27Z","timestamp":1750220607000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3055399.3055439"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,19]]},"references-count":33,"alternative-id":["10.1145\/3055399.3055439","10.1145\/3055399"],"URL":"https:\/\/doi.org\/10.1145\/3055399.3055439","relation":{},"subject":[],"published":{"date-parts":[[2017,6,19]]},"assertion":[{"value":"2017-06-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}