Streaming algorithms for monotone non-submodular function maximization under a knapsack constraint on the integer lattice
The study of non-submodular maximization on the integer lattice is an important extension of submodular optimization. In this paper, streaming algorithms for maximizing non-negative monotone non-submodular functions with knapsack constraint on integer lattice are considered. We first design a two-pa...
Uloženo v:
| Vydáno v: | Theoretical computer science Ročník 937; s. 39 - 49 |
|---|---|
| Hlavní autoři: | , , , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier B.V
18.11.2022
|
| Témata: | |
| ISSN: | 0304-3975, 1879-2294 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | The study of non-submodular maximization on the integer lattice is an important extension of submodular optimization. In this paper, streaming algorithms for maximizing non-negative monotone non-submodular functions with knapsack constraint on integer lattice are considered. We first design a two-pass StreamingKnapsack algorithm combining with BinarySearch as a subroutine for this problem. By introducing the DR ratio γ and the weak DR ratio γw of the non-submodular objective function, we obtain that the approximation ratio is min{γ2(1−ε)/2γ+1,1−1/γw2γ−ε}, the total memory complexity is O(KlogK/ε), and the total query complexity for each element is O(logKlog(K/ε2)/ε). Then, we design a one-pass streaming algorithm by dynamically updating the maximal function value among unit vectors along with the currently arriving element. Finally, in order to decrease the memory complexity, we design an improved StreamingKnapsack algorithm and reduce the memory complexity to O(K/ε2).
•A two-pass streaming algorithm is proposed for maximizing monotone non-submodular functions with knapsack constraint on integer lattice.•By introducing DR ratio γd (weak DR ratio γw) we obtain the approximation ratio as min{γ2(1−ε)/2γ+1,1−1/γw2γ−ε} with memory O(KlogK/ε).•A one-pass streaming algorithm is designed by dynamically updating the maximal function value among unit vectors.•We design an improve StreamingKnapsack algorithm and reduce the memory complexity to O(K/ε2). |
|---|---|
| AbstractList | The study of non-submodular maximization on the integer lattice is an important extension of submodular optimization. In this paper, streaming algorithms for maximizing non-negative monotone non-submodular functions with knapsack constraint on integer lattice are considered. We first design a two-pass StreamingKnapsack algorithm combining with BinarySearch as a subroutine for this problem. By introducing the DR ratio γ and the weak DR ratio γw of the non-submodular objective function, we obtain that the approximation ratio is min{γ2(1−ε)/2γ+1,1−1/γw2γ−ε}, the total memory complexity is O(KlogK/ε), and the total query complexity for each element is O(logKlog(K/ε2)/ε). Then, we design a one-pass streaming algorithm by dynamically updating the maximal function value among unit vectors along with the currently arriving element. Finally, in order to decrease the memory complexity, we design an improved StreamingKnapsack algorithm and reduce the memory complexity to O(K/ε2).
•A two-pass streaming algorithm is proposed for maximizing monotone non-submodular functions with knapsack constraint on integer lattice.•By introducing DR ratio γd (weak DR ratio γw) we obtain the approximation ratio as min{γ2(1−ε)/2γ+1,1−1/γw2γ−ε} with memory O(KlogK/ε).•A one-pass streaming algorithm is designed by dynamically updating the maximal function value among unit vectors.•We design an improve StreamingKnapsack algorithm and reduce the memory complexity to O(K/ε2). |
| Author | Tan, Jingjing Zhang, Xiaoqing Zhou, Yang Ye, Weina Wang, Fengmin |
| Author_xml | – sequence: 1 givenname: Jingjing surname: Tan fullname: Tan, Jingjing email: tanjingjing1108@163.com organization: School of Mathematics and Information Science, Weifang University, Weifang 261061, PR China – sequence: 2 givenname: Fengmin surname: Wang fullname: Wang, Fengmin email: casic_wfm@163.com organization: Beijing Jinghang Research Institute of Computing and Communication, Beijing 100074, PR China – sequence: 3 givenname: Weina surname: Ye fullname: Ye, Weina email: yewn@emails.bjut.edu.cn organization: Beijing Institute for Scientific and Engineering Computing, Beijing University of Technology, Beijing 100124, PR China – sequence: 4 givenname: Xiaoqing surname: Zhang fullname: Zhang, Xiaoqing email: zhangxq0808@emails.bjut.edu.cn organization: Beijing Institute for Scientific and Engineering Computing, Beijing University of Technology, Beijing 100124, PR China – sequence: 5 givenname: Yang orcidid: 0000-0001-5692-6281 surname: Zhou fullname: Zhou, Yang email: zhouyang@sdnu.edu.cn organization: School of Mathematics and Statistics, Shandong Normal University, Jinan 250014, PR China |
| BookMark | eNp9kE1PwzAMhiM0JLbBD-CWP9CSpB9rxAlNfEmTOADnyE3dLVubTEmGGL-eDDjji23Zr1_rmZGJdRYJueYs54zXN9s86pALJkTOZM5Ec0amvFnITAhZTsiUFazMCrmoLsgshC1LUS3qKTm-Ro8wGrumMKydN3EzBto7T0dnXUwmNDll4dCOrjsM4Gl_sDoaZ-kIn2Y0X_DTHGyHngLdWdgH0DuqnQ3Rg7GRpnHcIE0lrtPSADEajZfkvIch4NVfnpP3h_u35VO2enl8Xt6tMi1KGbOylRxYhbzlAH3LsSlk1dSyrLui1LzTyBpsoS47XesS-woZVG3RiB574J0o5oT_3tXeheCxV3tvRvBHxZk6sVNbldipEzvFpErskub2V4PpsQ-DXgVt0GrsjEcdVefMP-pv8NV99Q |
| Cites_doi | 10.1137/080733991 10.1142/S0217595919500222 10.1007/s10898-019-00840-8 10.1007/BF01588971 10.1287/moor.7.3.410 10.1007/s10898-021-01014-1 10.1142/S1793830909000063 10.1007/s11590-019-01430-z 10.1061/(ASCE)0733-9496(2008)134:6(516) 10.1016/S0167-6377(03)00062-2 10.1007/s10107-015-0900-7 10.1007/s10107-018-1324-y 10.1007/s10898-019-00800-2 |
| ContentType | Journal Article |
| Copyright | 2022 Elsevier B.V. |
| Copyright_xml | – notice: 2022 Elsevier B.V. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.tcs.2022.09.028 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Computer Science |
| EISSN | 1879-2294 |
| EndPage | 49 |
| ExternalDocumentID | 10_1016_j_tcs_2022_09_028 S0304397522005709 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 123 1B1 1RT 1~. 1~5 4.4 457 4G. 5VS 7-5 71M 8P~ 9JN AABNK AACTN AAEDW AAFTH AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAXUO AAYFN ABAOU ABBOA ABJNI ABMAC ABYKQ ACAZW ACDAQ ACGFS ACRLP ACZNC ADBBV ADEZE AEBSH AEKER AENEX AFKWA AFTJW AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIKHN AITUG AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ARUGR AXJTR BKOJK BLXMC CS3 DU5 EBS EFJIC EFLBG EO8 EO9 EP2 EP3 F5P FDB FEDTE FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HVGLF IHE IXB J1W KOM LG9 M26 M41 MHUIS MO0 N9A O-L O9- OAUVE OK1 OZT P-8 P-9 P2P PC. Q38 ROL RPZ SCC SDF SDG SES SPC SPCBC SSV SSW T5K TN5 WH7 YNT ZMT ~G- 29Q 9DU AAEDT AAQXK AATTM AAXKI AAYWO AAYXX ABDPE ABEFU ABFNM ABWVN ABXDB ACLOT ACNNM ACRPL ACVFH ADCNI ADMUD ADNMO ADVLN AEIPS AEUPX AEXQZ AFJKZ AFPUW AGHFR AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS EJD FGOYB G-2 HZ~ R2- SEW SSZ TAE WUQ ZY4 ~HD |
| ID | FETCH-LOGICAL-c249t-4b91a05e1b1aafb1e839586946d34c1dce08eba64dc6c4ef5e0a5b382fefa1d23 |
| ISICitedReferencesCount | 0 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000894223300003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0304-3975 |
| IngestDate | Sat Nov 29 07:25:00 EST 2025 Fri Feb 23 02:40:25 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Streaming algorithms Integer lattice Non-submodular Knapsack constraint |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c249t-4b91a05e1b1aafb1e839586946d34c1dce08eba64dc6c4ef5e0a5b382fefa1d23 |
| ORCID | 0000-0001-5692-6281 |
| PageCount | 11 |
| ParticipantIDs | crossref_primary_10_1016_j_tcs_2022_09_028 elsevier_sciencedirect_doi_10_1016_j_tcs_2022_09_028 |
| PublicationCentury | 2000 |
| PublicationDate | 2022-11-18 |
| PublicationDateYYYYMMDD | 2022-11-18 |
| PublicationDate_xml | – month: 11 year: 2022 text: 2022-11-18 day: 18 |
| PublicationDecade | 2020 |
| PublicationTitle | Theoretical computer science |
| PublicationYear | 2022 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Krause, Leskovec, Guestrin, VanBriesen, Faloutsos (br0190) 2008; 134 Sviridenko (br0280) 2004; 32 Golovin, Krause (br0140) 2011; 42 Nemhauser, Wolsey, Fisher (br0250) 1978; 14 Wang, Xu, Wang, Zhang (br0350) 2020; 76 Yang, Xu, Jiang, Wang, Zhang (br0360) 2019; 36 EI-Arini, Guestrin (br0120) 2011 Soma, Kakimura, Inaba, Kawarabayashi (br0300) 2014 Soma, Yoshida (br0320) 2018; 172 Buchbinder, Feldman, Schwartz (br0040) 2015 Chakrabarti, Kale (br0070) 2015; 154 Soma, Yoshida (br0310) 2014 Ene, Nguyen (br0130) 2019 Alon, Gamzu, Tennenholtz (br0020) 2012 Kuhnle, Smith, Crawford, Thai (br0240) 2018 Das, Kempe (br0110) 2011 Vondrǎk (br0330) 2008 Huang, Kakimura (br0170) 2019 Călinescu, Chekuri, Pál, Vondrák (br0060) 2011; 40 Gomez, Leskovec, Krause (br0150) 2018; 8 Badanidiyuru, Mirzasoleiman, Karbasi, Krause (br0030) 2014 Agrawal, Gollapudi, Halverson, Ieong (br0010) 2009 Zhang, Du, Jiang, Wu (br0370) 2021; 80 Balkanski, Rubinstein, Singer (br0050) 2019 Kempe, Kleinberg, Tardos (br0220) 2003 Das, Kempe (br0100) 2008 Khanna, Elenberg, Dimakis, Negahban, Ghosh (br0230) 2017 Chekuri, Quanrud (br0080) 2019 Kapralov, Post, Vondrák (br0210) 2012 Norouzi-Fard, Tarnawski, Mitrovic, Zandieh, Mousavifar, Svensson (br0260) 2018 Gong, Nong, Liu, Fang (br0160) 2019; 75 Krause, Singh, Guestrin (br0200) 2008; 9 Jiang, Wang, Xu, Yang, Zhang (br0180) 2020; 14 Chekuri, Quanrud (br0090) 2018 Shioura (br0290) 2009; 1 Wolsey (br0340) 1982; 7 Kapralov (10.1016/j.tcs.2022.09.028_br0210) 2012 Gomez (10.1016/j.tcs.2022.09.028_br0150) 2018; 8 Agrawal (10.1016/j.tcs.2022.09.028_br0010) 2009 Krause (10.1016/j.tcs.2022.09.028_br0190) 2008; 134 Kempe (10.1016/j.tcs.2022.09.028_br0220) 2003 Badanidiyuru (10.1016/j.tcs.2022.09.028_br0030) 2014 Sviridenko (10.1016/j.tcs.2022.09.028_br0280) 2004; 32 Chekuri (10.1016/j.tcs.2022.09.028_br0090) 2018 Shioura (10.1016/j.tcs.2022.09.028_br0290) 2009; 1 Wolsey (10.1016/j.tcs.2022.09.028_br0340) 1982; 7 Zhang (10.1016/j.tcs.2022.09.028_br0370) 2021; 80 Chekuri (10.1016/j.tcs.2022.09.028_br0080) 2019 Huang (10.1016/j.tcs.2022.09.028_br0170) 2019 Ene (10.1016/j.tcs.2022.09.028_br0130) 2019 Das (10.1016/j.tcs.2022.09.028_br0110) 2011 EI-Arini (10.1016/j.tcs.2022.09.028_br0120) 2011 Vondrǎk (10.1016/j.tcs.2022.09.028_br0330) 2008 Khanna (10.1016/j.tcs.2022.09.028_br0230) 2017 Soma (10.1016/j.tcs.2022.09.028_br0320) 2018; 172 Wang (10.1016/j.tcs.2022.09.028_br0350) 2020; 76 Nemhauser (10.1016/j.tcs.2022.09.028_br0250) 1978; 14 Kuhnle (10.1016/j.tcs.2022.09.028_br0240) 2018 Călinescu (10.1016/j.tcs.2022.09.028_br0060) 2011; 40 Norouzi-Fard (10.1016/j.tcs.2022.09.028_br0260) 2018 Soma (10.1016/j.tcs.2022.09.028_br0300) 2014 Golovin (10.1016/j.tcs.2022.09.028_br0140) 2011; 42 Balkanski (10.1016/j.tcs.2022.09.028_br0050) 2019 Chakrabarti (10.1016/j.tcs.2022.09.028_br0070) 2015; 154 Soma (10.1016/j.tcs.2022.09.028_br0310) 2014 Das (10.1016/j.tcs.2022.09.028_br0100) 2008 Krause (10.1016/j.tcs.2022.09.028_br0200) 2008; 9 Jiang (10.1016/j.tcs.2022.09.028_br0180) 2020; 14 Buchbinder (10.1016/j.tcs.2022.09.028_br0040) 2015 Yang (10.1016/j.tcs.2022.09.028_br0360) 2019; 36 Gong (10.1016/j.tcs.2022.09.028_br0160) 2019; 75 Alon (10.1016/j.tcs.2022.09.028_br0020) 2012 |
| References_xml | – start-page: 671 year: 2014 end-page: 680 ident: br0030 article-title: Streaming submodular maximization: massive data summarization on the fly publication-title: Proceedings of KDD – start-page: 381 year: 2012 end-page: 388 ident: br0020 article-title: Optimizing budget allocation among channels and influencers publication-title: Proceedings of WWW – start-page: 137 year: 2003 end-page: 146 ident: br0220 article-title: Maximizing the spread of influence through a social network publication-title: Proceedings of KDD – start-page: 67 year: 2008 end-page: 74 ident: br0330 article-title: Optimal approximation for the submodular welfare problem in the value oracle model publication-title: Proceedings of STOC – volume: 7 start-page: 410 year: 1982 end-page: 425 ident: br0340 article-title: Maximising real-valued submodular set function: primal and dual heuristics for location problems publication-title: Math. Oper. Res. – start-page: 303 year: 2019 end-page: 322 ident: br0080 article-title: Submodular function maximization in parallel via the multilinear relaxation publication-title: Proceedings of SODA – start-page: 274 year: 2019 end-page: 282 ident: br0130 article-title: Submodular maximization with nearly-optimal approximation and adaptivity in nearly-linear time publication-title: Proceedings of SODA – start-page: 439 year: 2011 end-page: 447 ident: br0120 article-title: Beyond keyword search: discovering relevant scientific literature publication-title: Proceedings of ICKDDM – start-page: 1560 year: 2017 end-page: 1568 ident: br0230 article-title: Scalable greedy feature selection via weak submodularity publication-title: Proceedings of ICAIS – volume: 9 start-page: 235 year: 2008 end-page: 284 ident: br0200 article-title: Near-optimal sensor placements in gaussian processes: theory, efficient algorithms and empirical studies publication-title: J. Mach. Learn. Res. – volume: 42 start-page: 427 year: 2011 end-page: 486 ident: br0140 article-title: Adaptive submodularity: theory and applications in active learning and stochastic optimization publication-title: J. Artif. Intell. Res. – volume: 14 start-page: 1235 year: 2020 end-page: 1248 ident: br0180 article-title: Streaming algorithm for maximizing a monotone non-submodular function under publication-title: Optim. Lett. – start-page: 2791 year: 2018 end-page: 2800 ident: br0240 article-title: Fast maximization of non-submodular, monotonic functions on the integer lattice publication-title: Proceedings of ICML – start-page: 1216 year: 2012 end-page: 1225 ident: br0210 article-title: Online submodular welfare maximization: greedy is optimal publication-title: Proceedings of SODA – start-page: 45 year: 2008 end-page: 54 ident: br0100 article-title: Algorithms for subset selection in linear regression publication-title: Proceedings of STOC – volume: 8 start-page: 36 year: 2018 end-page: 39 ident: br0150 article-title: Inferring networks of diffusion and influence publication-title: ACM Trans. Knowl. Discov. Data – start-page: 438 year: 2019 end-page: 451 ident: br0170 article-title: Improved streaming algorithms for maximising monotone submodular functions under a knapsack constraint publication-title: Proceedings of WADS – volume: 76 start-page: 729 year: 2020 end-page: 743 ident: br0350 article-title: Non-submodular maximization on massive data streams publication-title: J. Glob. Optim. – volume: 14 start-page: 265 year: 1978 end-page: 294 ident: br0250 article-title: An analysis of approximations for maximizing submodular set functions publication-title: Math. Program. – volume: 32 start-page: 41 year: 2004 end-page: 43 ident: br0280 article-title: A note on maximizing a submodular set function subject to a knapsack constraint publication-title: Oper. Res. Lett. – volume: 1 start-page: 1 year: 2009 end-page: 23 ident: br0290 article-title: On the pipage rounding algorithm for submodular function maximization-a view from discrete convex analysis publication-title: Discrete Math. Algorithms Appl. – start-page: 351 year: 2014 end-page: 359 ident: br0300 article-title: Optimal budget allocation: theoretical guarantee and efficient algorithm publication-title: Proceedings of ICML – volume: 36 start-page: 195 year: 2019 end-page: 220 ident: br0360 article-title: Approximation robust parameterized submodular function maximaization in large-scales publication-title: Asia-Pac. J. Oper. Res. – volume: 40 start-page: 1740 year: 2011 end-page: 1766 ident: br0060 article-title: Maximizing a submodular set function subject to a matroid constraint publication-title: SIAM J. Comput. – start-page: 283 year: 2019 end-page: 302 ident: br0050 article-title: An exponential speedup in parallel running time for submodular maximization without loss in approximation publication-title: Proceedings of SODA – start-page: 358 year: 2018 end-page: 377 ident: br0090 article-title: Randomize MWU for positive lps publication-title: Proceedings of SODA – start-page: 1202 year: 2015 end-page: 1216 ident: br0040 article-title: Onling submodular maximization with preemption publication-title: Proceedings of SODA – volume: 154 start-page: 225 year: 2015 end-page: 247 ident: br0070 article-title: Submodular maximization meets streaming: matchings, matroids, and more publication-title: Math. Program. – volume: 75 start-page: 833 year: 2019 end-page: 849 ident: br0160 article-title: Parametric monotone function maximization with matroid constraints publication-title: J. Glob. Optim. – volume: 80 start-page: 595 year: 2021 end-page: 616 ident: br0370 article-title: Maximizing DR-submodular + supermodular function on the integer lattice subject to a cardinality constraint publication-title: J. Glob. Optim. – start-page: 3829 year: 2018 end-page: 3838 ident: br0260 article-title: Beyond 1/2-approximation for submodular maximization on massive data streams publication-title: Proceedings of ICML – volume: 172 start-page: 539 year: 2018 end-page: 563 ident: br0320 article-title: Maximization monotone submodular functions over the integer lattice publication-title: Math. Program. – start-page: 1057 year: 2011 end-page: 1064 ident: br0110 article-title: Submodular meets spectral: greedy algorithms for subset selection, sparse approximation and dictionary selection publication-title: Proceedings of ICML – start-page: 5 year: 2009 end-page: 14 ident: br0010 article-title: Diversifying search results publication-title: Proceedings of WSDM – volume: 134 start-page: 516 year: 2008 end-page: 526 ident: br0190 article-title: Efficient sensor placement optimization for securing large water distribution networks publication-title: J. Water Resour. Plan. Manag. – start-page: 847 year: 2014 end-page: 855 ident: br0310 article-title: A generalization of submodular cover via the diminishing return property on the integer lattice publication-title: Proceedings of NIPS – volume: 40 start-page: 1740 year: 2011 ident: 10.1016/j.tcs.2022.09.028_br0060 article-title: Maximizing a submodular set function subject to a matroid constraint publication-title: SIAM J. Comput. doi: 10.1137/080733991 – start-page: 1057 year: 2011 ident: 10.1016/j.tcs.2022.09.028_br0110 article-title: Submodular meets spectral: greedy algorithms for subset selection, sparse approximation and dictionary selection – start-page: 5 year: 2009 ident: 10.1016/j.tcs.2022.09.028_br0010 article-title: Diversifying search results – volume: 36 start-page: 195 year: 2019 ident: 10.1016/j.tcs.2022.09.028_br0360 article-title: Approximation robust parameterized submodular function maximaization in large-scales publication-title: Asia-Pac. J. Oper. Res. doi: 10.1142/S0217595919500222 – volume: 76 start-page: 729 year: 2020 ident: 10.1016/j.tcs.2022.09.028_br0350 article-title: Non-submodular maximization on massive data streams publication-title: J. Glob. Optim. doi: 10.1007/s10898-019-00840-8 – start-page: 439 year: 2011 ident: 10.1016/j.tcs.2022.09.028_br0120 article-title: Beyond keyword search: discovering relevant scientific literature – volume: 9 start-page: 235 year: 2008 ident: 10.1016/j.tcs.2022.09.028_br0200 article-title: Near-optimal sensor placements in gaussian processes: theory, efficient algorithms and empirical studies publication-title: J. Mach. Learn. Res. – volume: 14 start-page: 265 year: 1978 ident: 10.1016/j.tcs.2022.09.028_br0250 article-title: An analysis of approximations for maximizing submodular set functions publication-title: Math. Program. doi: 10.1007/BF01588971 – start-page: 847 year: 2014 ident: 10.1016/j.tcs.2022.09.028_br0310 article-title: A generalization of submodular cover via the diminishing return property on the integer lattice – start-page: 351 year: 2014 ident: 10.1016/j.tcs.2022.09.028_br0300 article-title: Optimal budget allocation: theoretical guarantee and efficient algorithm – start-page: 671 year: 2014 ident: 10.1016/j.tcs.2022.09.028_br0030 article-title: Streaming submodular maximization: massive data summarization on the fly – start-page: 1202 year: 2015 ident: 10.1016/j.tcs.2022.09.028_br0040 article-title: Onling submodular maximization with preemption – start-page: 3829 year: 2018 ident: 10.1016/j.tcs.2022.09.028_br0260 article-title: Beyond 1/2-approximation for submodular maximization on massive data streams – start-page: 283 year: 2019 ident: 10.1016/j.tcs.2022.09.028_br0050 article-title: An exponential speedup in parallel running time for submodular maximization without loss in approximation – start-page: 358 year: 2018 ident: 10.1016/j.tcs.2022.09.028_br0090 article-title: Randomize MWU for positive lps – start-page: 137 year: 2003 ident: 10.1016/j.tcs.2022.09.028_br0220 article-title: Maximizing the spread of influence through a social network – start-page: 303 year: 2019 ident: 10.1016/j.tcs.2022.09.028_br0080 article-title: Submodular function maximization in parallel via the multilinear relaxation – volume: 42 start-page: 427 year: 2011 ident: 10.1016/j.tcs.2022.09.028_br0140 article-title: Adaptive submodularity: theory and applications in active learning and stochastic optimization publication-title: J. Artif. Intell. Res. – volume: 7 start-page: 410 year: 1982 ident: 10.1016/j.tcs.2022.09.028_br0340 article-title: Maximising real-valued submodular set function: primal and dual heuristics for location problems publication-title: Math. Oper. Res. doi: 10.1287/moor.7.3.410 – volume: 80 start-page: 595 year: 2021 ident: 10.1016/j.tcs.2022.09.028_br0370 article-title: Maximizing DR-submodular + supermodular function on the integer lattice subject to a cardinality constraint publication-title: J. Glob. Optim. doi: 10.1007/s10898-021-01014-1 – volume: 1 start-page: 1 year: 2009 ident: 10.1016/j.tcs.2022.09.028_br0290 article-title: On the pipage rounding algorithm for submodular function maximization-a view from discrete convex analysis publication-title: Discrete Math. Algorithms Appl. doi: 10.1142/S1793830909000063 – start-page: 2791 year: 2018 ident: 10.1016/j.tcs.2022.09.028_br0240 article-title: Fast maximization of non-submodular, monotonic functions on the integer lattice – start-page: 1216 year: 2012 ident: 10.1016/j.tcs.2022.09.028_br0210 article-title: Online submodular welfare maximization: greedy is optimal – volume: 14 start-page: 1235 year: 2020 ident: 10.1016/j.tcs.2022.09.028_br0180 article-title: Streaming algorithm for maximizing a monotone non-submodular function under d-knapsack constraint publication-title: Optim. Lett. doi: 10.1007/s11590-019-01430-z – volume: 134 start-page: 516 year: 2008 ident: 10.1016/j.tcs.2022.09.028_br0190 article-title: Efficient sensor placement optimization for securing large water distribution networks publication-title: J. Water Resour. Plan. Manag. doi: 10.1061/(ASCE)0733-9496(2008)134:6(516) – volume: 32 start-page: 41 year: 2004 ident: 10.1016/j.tcs.2022.09.028_br0280 article-title: A note on maximizing a submodular set function subject to a knapsack constraint publication-title: Oper. Res. Lett. doi: 10.1016/S0167-6377(03)00062-2 – start-page: 67 year: 2008 ident: 10.1016/j.tcs.2022.09.028_br0330 article-title: Optimal approximation for the submodular welfare problem in the value oracle model – volume: 8 start-page: 36 year: 2018 ident: 10.1016/j.tcs.2022.09.028_br0150 article-title: Inferring networks of diffusion and influence publication-title: ACM Trans. Knowl. Discov. Data – start-page: 438 year: 2019 ident: 10.1016/j.tcs.2022.09.028_br0170 article-title: Improved streaming algorithms for maximising monotone submodular functions under a knapsack constraint – volume: 154 start-page: 225 year: 2015 ident: 10.1016/j.tcs.2022.09.028_br0070 article-title: Submodular maximization meets streaming: matchings, matroids, and more publication-title: Math. Program. doi: 10.1007/s10107-015-0900-7 – start-page: 381 year: 2012 ident: 10.1016/j.tcs.2022.09.028_br0020 article-title: Optimizing budget allocation among channels and influencers – start-page: 274 year: 2019 ident: 10.1016/j.tcs.2022.09.028_br0130 article-title: Submodular maximization with nearly-optimal approximation and adaptivity in nearly-linear time – start-page: 1560 year: 2017 ident: 10.1016/j.tcs.2022.09.028_br0230 article-title: Scalable greedy feature selection via weak submodularity – volume: 172 start-page: 539 year: 2018 ident: 10.1016/j.tcs.2022.09.028_br0320 article-title: Maximization monotone submodular functions over the integer lattice publication-title: Math. Program. doi: 10.1007/s10107-018-1324-y – volume: 75 start-page: 833 year: 2019 ident: 10.1016/j.tcs.2022.09.028_br0160 article-title: Parametric monotone function maximization with matroid constraints publication-title: J. Glob. Optim. doi: 10.1007/s10898-019-00800-2 – start-page: 45 year: 2008 ident: 10.1016/j.tcs.2022.09.028_br0100 article-title: Algorithms for subset selection in linear regression |
| SSID | ssj0000576 |
| Score | 2.3778539 |
| Snippet | The study of non-submodular maximization on the integer lattice is an important extension of submodular optimization. In this paper, streaming algorithms for... |
| SourceID | crossref elsevier |
| SourceType | Index Database Publisher |
| StartPage | 39 |
| SubjectTerms | Integer lattice Knapsack constraint Non-submodular Streaming algorithms |
| Title | Streaming algorithms for monotone non-submodular function maximization under a knapsack constraint on the integer lattice |
| URI | https://dx.doi.org/10.1016/j.tcs.2022.09.028 |
| Volume | 937 |
| WOSCitedRecordID | wos000894223300003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1879-2294 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000576 issn: 0304-3975 databaseCode: AIEXJ dateStart: 20211211 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1bb9MwFLaqjgd44DJAjJv8wBNRpsRxEvtxQkOAxIREEeUpcmxntFsvNNnU_SN-Jse3pmUgARIvUZXKzpHPJx_7XL6D0AshEp1TrWNWKBrToiYxF1rFEqy1AJNYF7KxzSbKkxM2HvMPg8H3UAtzeV7O52y95sv_qmp4B8o2pbN_oe7NpPACfoPS4Qlqh-cfKd7EmcXM1h6eny7g7v_VcS5EIMHCUG9HcOOPW7CDC2VzUI1psyiYifVk5usybX_cVSSis7lYtkKemfz01jaU6HyAwVFNaOPz7EIKXTjnjrbqI6VvHBF5a9s7C1xdCIg6DQbUuvbd9gOLejqbbLD7xXpeP2vf7nvH2T2eiMW3MIV3YcDt16TRsd6vdq22xtVzmZgNd31VDrXbnlnJY0JcW-Swf3PHGuN3YEeN5G25Y0O9ZiWcw2J62ElD2E6IZbr1Neq75NsfjRRGCGK8b6WpFN0jZc7ZEO0dvT0ev-utfl66uLiXOkTQbS7hTx_69Rlo61wzuotu-wsJPnJAuocGer6P7oRmH9jv_fvo1vsNwW97H11tUIZ7lGFAGQ4ow7sowwFleBtl2KIMCxxQhnuUYfgbvog9yrBH2QP06fXx6NWb2HfxiCVc7buY1jwVSa7TOhWiqVMNR_KcFZwWKqMyVVInTNeioEoWkuom14nI64yRRjciVSR7iIYgsX6EMK8zGNdkDVOKyiQXIuUwr84ywmqm-QF6Gda1WjqylipkMU4rUEJllFAlvAIlHCAaVr7y-HenyApg8vthj_9t2BN0s0f-UzTsVhf6GbohL7tJu3ruwfQDwKCsoQ |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Streaming+algorithms+for+monotone+non-submodular+function+maximization+under+a+knapsack+constraint+on+the+integer+lattice&rft.jtitle=Theoretical+computer+science&rft.au=Tan%2C+Jingjing&rft.au=Wang%2C+Fengmin&rft.au=Ye%2C+Weina&rft.au=Zhang%2C+Xiaoqing&rft.date=2022-11-18&rft.pub=Elsevier+B.V&rft.issn=0304-3975&rft.eissn=1879-2294&rft.volume=937&rft.spage=39&rft.epage=49&rft_id=info:doi/10.1016%2Fj.tcs.2022.09.028&rft.externalDocID=S0304397522005709 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0304-3975&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0304-3975&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0304-3975&client=summon |