{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T04:21:39Z","timestamp":1747196499142,"version":"3.40.5"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319130743"},{"type":"electronic","value":"9783319130750"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[[2014]]},"DOI":"10.1007\/978-3-319-13075-0_59","type":"book-chapter","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T16:37:06Z","timestamp":1415983026000},"page":"753-765","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Simple Efficient Interior Point Method for Min-Cost Flow"],"prefix":"10.1007","author":[{"given":"Ruben","family":"Becker","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Karrenbauer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,11,8]]},"reference":[{"key":"59_CR1","unstructured":"Edmonds, J., Karp, R.M.: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems. In: Combinatorial Structures and Their Applications, pp. 93\u201396. Gordon and Breach, New York (1970)"},{"key":"59_CR2","doi-asserted-by":"crossref","unstructured":"Orlin, J.B.: A Faster Strongly Polynominal Minimum Cost Flow Algorithm. In: Simon, J. (ed.) STOC, pp. 377\u2013387. ACM (1988)","DOI":"10.21236\/ADA457044"},{"key":"59_CR3","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1287\/moor.15.3.430","volume":"15","author":"AV Goldberg","year":"1990","unstructured":"Goldberg, A.V., Tarjan, R.E.: Finding minimum-cost circulations by successive approximation. Math. Oper. Res. 15, 430\u2013466 (1990)","journal-title":"Math. Oper. Res."},{"key":"59_CR4","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/BF01585705","volume":"53","author":"RK Ahuja","year":"1992","unstructured":"Ahuja, R.K., Goldberg, A.V., Orlin, J.B., Tarjan, R.E.: Finding minimum-cost flows by double scaling. Math. Program. 53, 243\u2013266 (1992)","journal-title":"Math. Program."},{"key":"59_CR5","doi-asserted-by":"crossref","unstructured":"Karmarkar, N.: A New Polynomial-Time Algorithm for Linear Programming. In: DeMillo, R.A. (ed.) STOC 1984, pp. 302\u2013311. ACM (1984)","DOI":"10.1145\/800057.808695"},{"key":"59_CR6","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/BF01594937","volume":"50","author":"Y Ye","year":"1991","unstructured":"Ye, Y.: An $$O(n^3 L)$$ potential reduction algorithm for linear programming. Math. Program. 50, 239\u2013258 (1991)","journal-title":"Math. Program."},{"key":"59_CR7","doi-asserted-by":"crossref","unstructured":"Vaidya, P.M.: Speeding-Up Linear Programming Using Fast Matrix Multiplication (Extended Abstract). In: FOCS, pp. 332\u2013337. IEEE Computer Society (1989)","DOI":"10.1109\/SFCS.1989.63499"},{"key":"59_CR8","doi-asserted-by":"crossref","unstructured":"M\u0105dry, A.: Navigating Central Path with Electrical Flows: from Flows to Matchings, and Back. In: 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS) (2013)","DOI":"10.1109\/FOCS.2013.35"},{"key":"59_CR9","doi-asserted-by":"crossref","unstructured":"Daitch, S.I., Spielman, D.A.: Faster approximate lossy generalized flow via interior point algorithms. In: Dwork, C. (ed.) STOC, pp. 451\u2013460. ACM (2008)","DOI":"10.1145\/1374376.1374441"},{"key":"59_CR10","doi-asserted-by":"crossref","unstructured":"Spielman, D.A., Teng, S.H.: Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In Babai, L. (ed.) STOC, pp. 81\u201390. ACM (2004)","DOI":"10.1145\/1007352.1007372"},{"key":"59_CR11","doi-asserted-by":"crossref","unstructured":"Koutis, I., Miller, G.L., Peng, R.: Approaching Optimality for Solving SDD Linear Systems. In: FOCS, pp. 235\u2013244. IEEE Computer Society (2010)","DOI":"10.1109\/FOCS.2010.29"},{"key":"59_CR12","doi-asserted-by":"crossref","unstructured":"Kelner, J.A., Orecchia, L., Sidford, A., Zhu, Z.A.: A Simple, Combinatorial Algorithm for Solving SDD Systems in Nearly-Linear Time. In: Boneh, D., Roughgarden, T., Feigenbaum, J. (eds.) STOC, pp. 911\u2013920. ACM (2013)","DOI":"10.1145\/2488608.2488724"},{"key":"59_CR13","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network flows - Theory. Algorithms and Applications. Prentice Hall (1993)"},{"key":"59_CR14","doi-asserted-by":"crossref","unstructured":"Abraham, I., Neiman, O.: Using Petal-Decompositions to Build a Low Stretch Spanning Tree. In: Karloff, H.J., Pitassi, T. (eds.) STOC, pp. 395\u2013406. ACM (2012)","DOI":"10.1145\/2213977.2214015"},{"key":"59_CR15","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Algorithms and combinatorics. Springer (2003)"},{"key":"59_CR16","doi-asserted-by":"crossref","unstructured":"Goldberg, A.V., Rao, S.: Beyond the Flow Decomposition Barrier. In: FOCS, pp. 2\u201311 (1997)","DOI":"10.1109\/SFCS.1997.646087"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-13075-0_59","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T18:11:30Z","timestamp":1747159890000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-13075-0_59"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319130743","9783319130750"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-13075-0_59","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"8 November 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}