{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T10:25:28Z","timestamp":1778495128403,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":89,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T00:00:00Z","timestamp":1717977600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Israel Science Foundation","award":["2233\\\/19, 459\\\/20"],"award-info":[{"award-number":["2233\\\/19, 459\\\/20"]}]},{"name":"U.S.-Israel Binational Science Foundation","award":["2022418"],"award-info":[{"award-number":["2022418"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,6,10]]},"DOI":"10.1145\/3618260.3649630","type":"proceedings-article","created":{"date-parts":[[2024,6,11]],"date-time":"2024-06-11T19:25:02Z","timestamp":1718133902000},"page":"1820-1831","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["Constrained Submodular Maximization via New Bounds for DR-Submodular Functions"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7014-8954","authenticated-orcid":false,"given":"Niv","family":"Buchbinder","sequence":"first","affiliation":[{"name":"Tel Aviv University, Tel-Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1535-2979","authenticated-orcid":false,"given":"Moran","family":"Feldman","sequence":"additional","affiliation":[{"name":"University of Haifa, Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,6,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(99)00103-1"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2021.1224"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3440959.3440964"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2907052"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1561\/2200000039"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1287\/OPRE.2021.2170"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188752"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2500121"},{"key":"e_1_3_2_1_9_1","volume-title":"Non-monotone Continuous DR-submodular Maximization: Structure and Algorithms. In Annual Conference on Neural Information Processing Systems 2017 (NIPS). NIPS Foundation","author":"Bian An","year":"2017","unstructured":"An Bian, Kfir Yehuda Levy, Andreas Krause, and Joachim M. Buhmann. 2017. Non-monotone Continuous DR-submodular Maximization: Structure and Algorithms. In Annual Conference on Neural Information Processing Systems 2017 (NIPS). NIPS Foundation, La Jolla, California. 486\u2013496. https:\/\/proceedings.neurips.cc\/paper\/2017\/hash\/58238e9ae2dd305d79c2ebc8c1883422-Abstract.html"},{"key":"e_1_3_2_1_10_1","volume-title":"International Conference on Artificial Intelligence and Statistics (AISTATS) (Proceedings of Machine Learning Research","volume":"120","author":"Bian Andrew An","year":"2017","unstructured":"Andrew An Bian, Baharan Mirzasoleiman, Joachim M. Buhmann, and Andreas Krause. 2017. Guaranteed Non-convex Optimization: Submodular Maximization over Continuous Domains. In International Conference on Artificial Intelligence and Statistics (AISTATS) (Proceedings of Machine Learning Research, Vol. 54). PMLR, Cambridge, MA. 111\u2013120. http:\/\/proceedings.mlr.press\/v54\/bian17a.html"},{"key":"e_1_3_2_1_11_1","volume-title":"PInternational Conference on Machine Learning (ICML) (Proceedings of Machine Learning Research","volume":"653","author":"Bian Yatao An","year":"2019","unstructured":"Yatao An Bian, Joachim M. Buhmann, and Andreas Krause. 2019. Optimal Continuous DR-Submodular Maximization and Applications to Provable Mean Field Inference. In PInternational Conference on Machine Learning (ICML) (Proceedings of Machine Learning Research, Vol. 97). PMLR, Cambridge, MA. 644\u2013653. http:\/\/proceedings.mlr.press\/v97\/bian19a.html"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2001.10011"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-020-01570-6"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1287\/MOOR.2018.0955"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.2311.01129"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/S10107-019-01459-Z"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.106"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.106"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/130929205"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3309764"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/080733991"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47672-7_26"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700382820"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316406"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.20"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.60"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/110839655"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316327"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/J.IPL.2006.06.003"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(84)90003-9"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.23.8.789"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70732-5"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465456.3467615"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2205.12442"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2020"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.34"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISTCS.1995.377033"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1137\/090779346"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.14"},{"key":"e_1_3_2_1_41_1","unstructured":"Moran Feldman. 2013. Maximization problems with submodular objective functions. Ph. D. Dissertation. Technion - Israel Institute of Technology Israel. https:\/\/technion.primo.exlibrisgroup.com\/permalink\/972TEC_INST\/q1jq5o\/alma990023478210203971"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2022.59"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.46"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23719-5_66"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384286"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1137\/16M1105220"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0121195"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/1109557.1109624"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02523688"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973082.83"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/227683.227684"},{"key":"e_1_3_2_1_52_1","volume-title":"Symposium on Discrete Algorithms (SODA). ACM\/SIAM","author":"Halperin Eran","year":"2001","unstructured":"Eran Halperin and Uri Zwick. 2001. Combinatorial approximation algorithms for the maximum directed cut problem. In Symposium on Discrete Algorithms (SODA). ACM\/SIAM, Philadelphia, PA. 1\u20137. http:\/\/dl.acm.org\/citation.cfm?id=365411.365412"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367524"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/502090.502098"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01917662"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0120891"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995589"},{"key":"e_1_3_2_1_58_1","first-page":"341","article-title":"The efficacy of the greedy algorithm","volume":"17","author":"Jenkyns T.","year":"1976","unstructured":"T. Jenkyns. 1976. The efficacy of the greedy algorithm. Cong. Num., 17 (1976), 341\u2013350.","journal-title":"Cong. Num."},{"key":"e_1_3_2_1_59_1","volume-title":"Complexity of Computer Computations","author":"Karp Richard M.","unstructured":"Richard M. Karp. 1972. Reducibility among combinatorial problems. In Complexity of Computer Computations. Plenum Press, New York, NY. 85\u2013103."},{"key":"e_1_3_2_1_60_1","volume-title":"Minimum Memory and Low Adaptive Complexity. In International Conference on Machine Learning (ICML) (Proceedings of Machine Learning Research","volume":"3320","author":"Kazemi Ehsan","year":"2019","unstructured":"Ehsan Kazemi, Marko Mitrovic, Morteza Zadimoghaddam, Silvio Lattanzi, and Amin Karbasi. 2019. Submodular Streaming in All Its Glory: Tight Approximation, Minimum Memory and Low Adaptive Complexity. In International Conference on Machine Learning (ICML) (Proceedings of Machine Learning Research, Vol. 97). PMLR, Cambridge, MA. 3311\u20133320. http:\/\/proceedings.mlr.press\/v97\/kazemi19a.html"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.4086\/TOC.2015.V011A004"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705447372"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(99)00031-9"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70322-4"},{"key":"e_1_3_2_1_65_1","volume-title":"Near-optimal Nonmyopic Value of Information in Graphical Models. In Conference in Uncertainty in Artificial Intelligence (UAI). AUAI Press","author":"Krause Andreas","year":"2005","unstructured":"Andreas Krause and Carlos Guestrin. 2005. Near-optimal Nonmyopic Value of Information in Graphical Models. In Conference in Uncertainty in Artificial Intelligence (UAI). AUAI Press, Corvallis, Oregon. 324\u2013331. https:\/\/dslpitt.org\/uai\/displayArticleDetails.jsp?mmnu=1&smnu=2&article_id=1238&proceeding_id=21"},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1061\/(ASCE)0733-9496(2008)134:6(516)"},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.5555\/1390681.1390689"},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2013.0592"},{"key":"e_1_3_2_1_69_1","volume-title":"Convergence Rate of Frank-Wolfe for Non-Convex Objectives. CoRR, abs\/1607.00345","author":"Lacoste-Julien Simon","year":"2016","unstructured":"Simon Lacoste-Julien. 2016. Convergence Rate of Frank-Wolfe for Non-Convex Objectives. CoRR, abs\/1607.00345 (2016), 6 pages. arXiv:1607.00345. arxiv:1607.00345"},{"key":"e_1_3_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1137\/090750020"},{"key":"e_1_3_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1287\/MOOR.1100.0463"},{"key":"e_1_3_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.114"},{"key":"e_1_3_2_1_73_1","volume-title":"Human Language Technologies: Conference of the North American Chapter of the Association of Computational Linguistics (HLT-NAACL). The Association for Computational Linguistics","author":"Lin Hui","unstructured":"Hui Lin and Jeff A. Bilmes. 2010. Multi-document Summarization via Budgeted Maximization of Submodular Functions. In Human Language Technologies: Conference of the North American Chapter of the Association of Computational Linguistics (HLT-NAACL). The Association for Computational Linguistics, Kerrville, TX. 912\u2013920. https:\/\/aclanthology.org\/N10-1134\/"},{"key":"e_1_3_2_1_74_1","volume-title":"Annual Meeting of the Association for Computational Linguistics: Human Language Technologies (ACL-HLT). The Association for Computer Linguistics","author":"Lin Hui","unstructured":"Hui Lin and Jeff A. Bilmes. 2011. A Class of Submodular Functions for Document Summarization. In Annual Meeting of the Association for Computational Linguistics: Human Language Technologies (ACL-HLT). The Association for Computer Linguistics, Kerrville, TX. 510\u2013520. https:\/\/aclanthology.org\/P11-1052\/"},{"key":"e_1_3_2_1_75_1","article-title":"Distributed Submodular Maximization","volume":"17","author":"Mirzasoleiman Baharan","year":"2016","unstructured":"Baharan Mirzasoleiman, Amin Karbasi, Rik Sarkar, and Andreas Krause. 2016. Distributed Submodular Maximization. J. Mach. Learn. Res., 17 (2016), 238:1\u2013238:44. http:\/\/jmlr.org\/papers\/v17\/mirzasoleiman16a.html","journal-title":"J. Mach. Learn. Res."},{"key":"e_1_3_2_1_76_1","volume-title":"Annual Conference on Neural Information Processing Systems (NeurIPS). NIPS Foundation","author":"Mitra Siddharth","year":"2021","unstructured":"Siddharth Mitra, Moran Feldman, and Amin Karbasi. 2021. Submodular + Concave. In Annual Conference on Neural Information Processing Systems (NeurIPS). NIPS Foundation, La Jolla, California. 11577\u201311591. https:\/\/proceedings.neurips.cc\/paper\/2021\/hash\/602443a3d6907117d8b4a308844e963e-Abstract.html"},{"key":"e_1_3_2_1_77_1","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2305.16903"},{"key":"e_1_3_2_1_78_1","volume-title":"Using Partial Monotonicity in Submodular Maximization","author":"Mualem Loay","year":"2022","unstructured":"Loay Mualem and Moran Feldman. 2022. Using Partial Monotonicity in Submodular Maximization. In NeurIPS. NIPS Foundation, La Jolla, California. 14 pages. http:\/\/papers.nips.cc\/paper_files\/paper\/2022\/hash\/1227a7a80529ecfe033065b9fcc5a042-Abstract-Conference.html"},{"key":"e_1_3_2_1_79_1","volume-title":"International Conference on Artificial Intelligence and Statistics (AISTATS) (Proceedings of Machine Learning Research","volume":"2564","author":"Mualem Loay","year":"2023","unstructured":"Loay Mualem and Moran Feldman. 2023. Resolving the Approximability of Offline and Online Non-monotone DR-Submodular Maximization over General Convex Sets. In International Conference on Artificial Intelligence and Statistics (AISTATS) (Proceedings of Machine Learning Research, Vol. 206). PMLR, Cambridge, MA. 2542\u20132564. https:\/\/proceedings.mlr.press\/v206\/mualem23a.html"},{"key":"e_1_3_2_1_80_1","doi-asserted-by":"publisher","DOI":"10.1287\/MOOR.3.3.177"},{"key":"e_1_3_2_1_81_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"e_1_3_2_1_82_1","article-title":"Optimal Algorithms for Continuous Non-monotone Submodular and DR-Submodular Maximization","volume":"21","author":"Niazadeh Rad","year":"2020","unstructured":"Rad Niazadeh, Tim Roughgarden, and Joshua R. Wang. 2020. Optimal Algorithms for Continuous Non-monotone Submodular and DR-Submodular Maximization. J. Mach. Learn. Res., 21 (2020), 125:1\u2013125:31. http:\/\/jmlr.org\/papers\/v21\/18-527.html","journal-title":"J. Mach. Learn. Res."},{"key":"e_1_3_2_1_83_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.74"},{"key":"e_1_3_2_1_84_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ISAAC.2022.41"},{"key":"e_1_3_2_1_85_1","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2205.15874"},{"key":"e_1_3_2_1_86_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.APPROX"},{"key":"e_1_3_2_1_87_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(03)00062-2"},{"key":"e_1_3_2_1_88_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539797328847"},{"key":"e_1_3_2_1_89_1","doi-asserted-by":"publisher","DOI":"10.1137\/110832318"}],"event":{"name":"STOC '24: 56th Annual ACM Symposium on Theory of Computing","location":"Vancouver BC Canada","acronym":"STOC '24","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 56th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3618260.3649630","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3618260.3649630","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:36:47Z","timestamp":1750178207000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3618260.3649630"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,10]]},"references-count":89,"alternative-id":["10.1145\/3618260.3649630","10.1145\/3618260"],"URL":"https:\/\/doi.org\/10.1145\/3618260.3649630","relation":{},"subject":[],"published":{"date-parts":[[2024,6,10]]},"assertion":[{"value":"2024-06-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}