{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:31:56Z","timestamp":1772119916435,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,1,11]],"date-time":"2015-01-11T00:00:00Z","timestamp":1420934400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1319376"],"award-info":[{"award-number":["CCF-1319376"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,1,11]]},"DOI":"10.1145\/2688073.2688086","type":"proceedings-article","created":{"date-parts":[[2015,1,12]],"date-time":"2015-01-12T20:42:45Z","timestamp":1421095365000},"page":"201-210","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":25,"title":["On Multiplicative Weight Updates for Concave and Submodular Function Maximization"],"prefix":"10.1145","author":[{"given":"Chandra","family":"Chekuri","sequence":"first","affiliation":[{"name":"University of Illinois, Champaign, IL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.S.","family":"Jayram","sequence":"additional","affiliation":[{"name":"IBM Almaden Research Center, San Jose, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Vondrak","sequence":"additional","affiliation":[{"name":"IBM Almaden Research Center, San Jose, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2015,1,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.35"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2012.v008a006"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250823"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31594-7_4"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623637"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/2634074.2634184"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2012.v008a024"},{"key":"e_1_3_2_1_8_1","volume-title":"Potential Function Methods for Approximately Solving Linear Programming Problems: Theory and Practice","author":"Bienstock D.","year":"2002","unstructured":"D. Bienstock . Potential Function Methods for Approximately Solving Linear Programming Problems: Theory and Practice . Springer , 2002 . D. Bienstock. Potential Function Methods for Approximately Solving Linear Programming Problems: Theory and Practice. Springer, 2002."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/2634074.2634144"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72792-7_15"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/080733991"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.60"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993740"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772715"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.02.064"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.46"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480199355754"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30140-0_34"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/795664.796457"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704446232"},{"key":"e_1_3_2_1_21_1","first-page":"2735","volume-title":"Advances in Neural Information Processing Systems","author":"Gillenwater J.","year":"2012","unstructured":"J. Gillenwater , A. Kulesza , and B. Taskar . Near-optimal map inference for determinantal point processes . In Advances in Neural Information Processing Systems , pages 2735 -- 2743 , 2012 . J. Gillenwater, A. Kulesza, and B. Taskar. Near-optimal map inference for determinantal point processes. In Advances in Neural Information Processing Systems, pages 2735--2743, 2012."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/0804004"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623499358689"},{"key":"e_1_3_2_1_24_1","first-page":"855","volume-title":"Proceedings of The 30th International Conference on Machine Learning","author":"Iyer R.","year":"2013","unstructured":"R. Iyer , S. Jegelka , and J. Bilmes . Fast semidifferential-based submodular function optimization . In Proceedings of The 30th International Conference on Machine Learning , pages 855 -- 863 , 2013 . R. Iyer, S. Jegelka, and J. Bilmes. Fast semidifferential-based submodular function optimization. In Proceedings of The 30th International Conference on Machine Learning, pages 855--863, 2013."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-007-0106-8"},{"key":"e_1_3_2_1_27_1","volume-title":"Indian Institute of Technology","author":"Khandekar R.","year":"2004","unstructured":"R. Khandekar . Lagrangian Relaxation based Algorithms for Convex Programming Problems. PhD thesis , Indian Institute of Technology , Delhi , 2004 . R. Khandekar. Lagrangian Relaxation based Algorithms for Convex Programming Problems. PhD thesis, Indian Institute of Technology, Delhi, 2004."},{"key":"e_1_3_2_1_28_1","volume-title":"Universitat des Saarlandes","author":"K\u00f6nemann J.","year":"1998","unstructured":"J. K\u00f6nemann . Fast combinatorial algorithms for packing and covering problems. Master's thesis , Universitat des Saarlandes , 1998 . Available at: http:\/\/www.math.uwaterloo.ca\/jochen\/docs\/diplom.ps. J. K\u00f6nemann. Fast combinatorial algorithms for packing and covering problems. Master's thesis, Universitat des Saarlandes, 1998. Available at: http:\/\/www.math.uwaterloo.ca\/jochen\/docs\/diplom.ps."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2007.16"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2013.0592"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486159.2486168"},{"key":"e_1_3_2_1_32_1","volume-title":"A continuous-time approach to online optimization. arXiv preprint arXiv:1401.6956","author":"Kwon J.","year":"2014","unstructured":"J. Kwon and P. Mertikopoulos . A continuous-time approach to online optimization. arXiv preprint arXiv:1401.6956 , 2014 . J. Kwon and P. Mertikopoulos. A continuous-time approach to online optimization. arXiv preprint arXiv:1401.6956, 2014."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1137\/090750020"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167211"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.20.2.257"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-007-0111-y"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374389"},{"key":"e_1_3_2_1_38_1","first-page":"170","volume-title":"Proc. 6th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA\u201995)","author":"Young N. E.","year":"1995","unstructured":"N. E. Young . Randomized rounding without solving the linear program . In Proc. 6th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA\u201995) , pages 170 -- 178 . ACM Press , 1995 . N. E. Young. Randomized rounding without solving the linear program. In Proc. 6th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA\u201995), pages 170--178. ACM Press, 1995."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.5555\/874063.875556"},{"key":"e_1_3_2_1_40_1","volume-title":"July","author":"Young N. E.","year":"2014","unstructured":"N. E. Young . Nearly linear-time approximation schemes for mixed packing\/covering and facility-location linear programs. ArXiv e-prints , July 2014 . N. E. Young. Nearly linear-time approximation schemes for mixed packing\/covering and facility-location linear programs. ArXiv e-prints, July 2014."}],"event":{"name":"ITCS'15: Innovations in Theoretical Computer Science","location":"Rehovot Israel","acronym":"ITCS'15","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2688073.2688086","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2688073.2688086","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:12:14Z","timestamp":1750227134000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2688073.2688086"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,11]]},"references-count":39,"alternative-id":["10.1145\/2688073.2688086","10.1145\/2688073"],"URL":"https:\/\/doi.org\/10.1145\/2688073.2688086","relation":{},"subject":[],"published":{"date-parts":[[2015,1,11]]},"assertion":[{"value":"2015-01-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}