{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T03:06:18Z","timestamp":1776395178791,"version":"3.51.2"},"publisher-location":"New York, NY, USA","reference-count":19,"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"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,6,19]]},"DOI":"10.1145\/3055399.3055501","type":"proceedings-article","created":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T20:27:45Z","timestamp":1497558465000},"page":"452-460","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":26,"title":["Area-convexity, l\n            <sub>\u221e<\/sub>\n            regularization, and undirected multicommodity flow"],"prefix":"10.1145","author":[{"given":"Jonah","family":"Sherman","sequence":"first","affiliation":[{"name":"University of California at Berkeley, USA"}]}],"member":"320","published-online":{"date-parts":[[2017,6,19]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"Amir Beck. 2015.  Amir Beck. 2015."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"crossref","unstructured":"On the convergence of alternating minimization for convex programming with applications to iteratively reweighted least squares and decomposition schemes. SIAM Journal on Optimization 25 1 (2015) 185\u2013209.  On the convergence of alternating minimization for convex programming with applications to iteratively reweighted least squares and decomposition schemes. SIAM Journal on Optimization 25 1 (2015) 185\u2013209.","DOI":"10.1137\/13094829X"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2422436.2422469"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1006\/game.1999.0738"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/2634074.2634090"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2213979"},{"key":"e_1_3_2_2_7_1","unstructured":"GM Korpelevich. 1977.  GM Korpelevich. 1977."},{"key":"e_1_3_2_2_8_1","unstructured":"Extragradient Method for Finding Saddle Points and Other Problems. Matekon 13 4 (1977) 35\u201349.  Extragradient Method for Finding Saddle Points and Other Problems. Matekon 13 4 (1977) 35\u201349."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623403425629"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-004-0552-5"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-006-0034-z"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/2884435.2884565"},{"key":"e_1_3_2_2_13_1","unstructured":"Serge A. Plotkin David B. Shmoys and Eva Tardos. 1995.  Serge A. Plotkin David B. Shmoys and Eva Tardos. 1995."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"crossref","unstructured":"Fast approximation algorithms for fractional packing and covering problems. Mathematics of Operations Research 20 (1995) 257\u2013301.  Fast approximation algorithms for fractional packing and covering problems. Mathematics of Operations Research 20 (1995) 257\u2013301.","DOI":"10.1287\/moor.20.2.257"},{"key":"e_1_3_2_2_15_1","unstructured":"Ralph Tyrell Rockafellar. 2015.  Ralph Tyrell Rockafellar. 2015."},{"key":"e_1_3_2_2_16_1","unstructured":"Convex analysis. Princeton university press.  Convex analysis. Princeton university press."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.36"},{"key":"e_1_3_2_2_18_1","volume-title":"Proceedings of the Twenty-Eigth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics","author":"Sherman Jonah","year":"2017"},{"key":"e_1_3_2_2_19_1","unstructured":"Daniel A. Spielman and Shang-Hua Teng. 2006. Nearly-Linear Time Algorithms for Preconditioning and Solving Symmetric Diagonally Dominant Linear Systems. CoRR abs\/cs\/0607105 (2006).  Daniel A. Spielman and Shang-Hua Teng. 2006. Nearly-Linear Time Algorithms for Preconditioning and Solving Symmetric Diagonally Dominant Linear Systems. CoRR abs\/cs\/0607105 (2006)."}],"event":{"name":"STOC '17: Symposium on Theory of Computing","location":"Montreal Canada","acronym":"STOC '17","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"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.3055501","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3055399.3055501","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:36:20Z","timestamp":1750217780000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3055399.3055501"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,19]]},"references-count":19,"alternative-id":["10.1145\/3055399.3055501","10.1145\/3055399"],"URL":"https:\/\/doi.org\/10.1145\/3055399.3055501","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"}}]}}