Improved deterministic algorithms for non-monotone submodular maximization
Saved in:
| Published in: | Theoretical computer science Vol. 984; p. 114293 |
|---|---|
| Main Authors: | , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
12.02.2024
|
| ISSN: | 0304-3975 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| ArticleNumber | 114293 |
|---|---|
| Author | Zhang, Shuo Sun, Xiaoming Zhang, Jialin Zhang, Zhijie |
| Author_xml | – sequence: 1 givenname: Xiaoming surname: Sun fullname: Sun, Xiaoming – sequence: 2 givenname: Jialin surname: Zhang fullname: Zhang, Jialin – sequence: 3 givenname: Shuo surname: Zhang fullname: Zhang, Shuo – sequence: 4 givenname: Zhijie surname: Zhang fullname: Zhang, Zhijie |
| BookMark | eNp9kL1OwzAUhT0UibbwAGx5gQTf3MRORlTxU1SJBWbLsR1wFMeV7SLg6UkpEwNnudN3z9G3IovJT4aQK6AFUGDXQ5FULEpaYgFQlS0uyJIirXJseX1OVjEOdE7N2ZI8bt0--HejM22SCc5ONiarMjm--mDTm4tZ70M2N-TOTz7NTVk8dM7rwyhD5uSHdfZLJuunC3LWyzGay9-7Ji93t8-bh3z3dL_d3OxyVVZ1yjWXDCRyiazRuqVUtRx5V7KmRjTKSACDpqTQ6ho1MiYV6AabnrMGulrjmsDprwo-xmB6sQ_WyfApgIqjADGIWYA4ChAnATPD_zDKpp_VKUg7_kN-AyLEZ04 |
| CitedBy_id | crossref_primary_10_1145_3708537 crossref_primary_10_1007_s10878_024_01232_9 crossref_primary_10_1007_s10898_024_01406_z crossref_primary_10_1007_s11704_024_40266_4 crossref_primary_10_1016_j_orl_2025_107295 |
| Cites_doi | 10.1145/1989734.1989736 10.1016/j.orl.2011.10.002 10.1287/moor.2018.0955 10.1007/BF01588971 10.1145/285055.285059 10.1287/moor.3.3.177 10.1016/S0020-0190(99)00031-9 10.1016/S0167-6377(03)00062-2 10.1137/090750020 10.1145/3184990 |
| ContentType | Journal Article |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.tcs.2023.114293 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Computer Science |
| ExternalDocumentID | 10_1016_j_tcs_2023_114293 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 123 1B1 1RT 1~. 1~5 29Q 4.4 457 4G. 5VS 7-5 71M 8P~ 9DU 9JN AABNK AAEDT AAEDW AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AATTM AAXKI AAXUO AAYFN AAYWO AAYXX ABAOU ABBOA ABDPE ABEFU ABFNM ABJNI ABMAC ABWVN ABXDB ACDAQ ACGFS ACLOT ACNNM ACRLP ACRPL ACVFH ACZNC ADBBV ADCNI ADEZE ADMUD ADNMO ADVLN AEBSH AEIPS AEKER AENEX AEUPX AEXQZ AFJKZ AFPUW AFTJW AGHFR AGQPQ AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIGII AIIUN AIKHN AITUG AKBMS AKRWK AKYEP ALMA_UNASSIGNED_HOLDINGS AMRAJ ANKPU AOUOD APXCP ARUGR ASPBG AVWKF AXJTR AZFZN BKOJK BLXMC CITATION CS3 DU5 EBS EFJIC EFKBS EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q GBLVA GBOLZ HVGLF HZ~ IHE IXB J1W KOM LG9 M26 M41 MHUIS MO0 N9A O-L O9- OAUVE OK1 OZT P-8 P-9 P2P PC. Q38 R2- ROL RPZ SCC SDF SDG SES SEW SPC SPCBC SSV SSW SSZ T5K TAE TN5 WH7 WUQ YNT ZMT ZY4 ~G- ~HD |
| ID | FETCH-LOGICAL-c245t-d7a61a37a368dd900c9737b268533ecea11e3e2019d53d366ac1d838f7681b5d3 |
| ISICitedReferencesCount | 6 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001133492900001&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:18:58 EST 2025 Tue Nov 18 21:45:06 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c245t-d7a61a37a368dd900c9737b268533ecea11e3e2019d53d366ac1d838f7681b5d3 |
| ParticipantIDs | crossref_primary_10_1016_j_tcs_2023_114293 crossref_citationtrail_10_1016_j_tcs_2023_114293 |
| PublicationCentury | 2000 |
| PublicationDate | 2024-02-12 |
| PublicationDateYYYYMMDD | 2024-02-12 |
| PublicationDate_xml | – month: 02 year: 2024 text: 2024-02-12 day: 12 |
| PublicationDecade | 2020 |
| PublicationTitle | Theoretical computer science |
| PublicationYear | 2024 |
| References | Kempe (10.1016/j.tcs.2023.114293_br0010) 2003 Iyer (10.1016/j.tcs.2023.114293_br0030) 2013 Iyer (10.1016/j.tcs.2023.114293_br0020) 2012 Nemhauser (10.1016/j.tcs.2023.114293_br0090) 1978; 14 Buchbinder (10.1016/j.tcs.2023.114293_br0170) 2019; 44 Han (10.1016/j.tcs.2023.114293_br0190) 2020 Feldman (10.1016/j.tcs.2023.114293_br0150) 2011 Kulik (10.1016/j.tcs.2023.114293_br0140) 2009 Lee (10.1016/j.tcs.2023.114293_br0240) 2010; 23 Schrijver (10.1016/j.tcs.2023.114293_br0270) 2003 Khuller (10.1016/j.tcs.2023.114293_br0110) 1999; 70 Amanatidis (10.1016/j.tcs.2023.114293_br0250) 2020 Buchbinder (10.1016/j.tcs.2023.114293_br0180) 2018; 14 Vondrák (10.1016/j.tcs.2023.114293_br0130) 2008 Gharan (10.1016/j.tcs.2023.114293_br0160) 2011 Azar (10.1016/j.tcs.2023.114293_br0290) 2012; vol. 7391 Nemhauser (10.1016/j.tcs.2023.114293_br0070) 1978; 3 Badanidiyuru (10.1016/j.tcs.2023.114293_br0280) 2014 Das (10.1016/j.tcs.2023.114293_br0050) 2008 Krause (10.1016/j.tcs.2023.114293_br0040) 2011; 2 Fisher (10.1016/j.tcs.2023.114293_br0100) 1978 Mirzasoleiman (10.1016/j.tcs.2023.114293_br0230) 2016; vol. 48 Amanatidis (10.1016/j.tcs.2023.114293_br0210) 2019 Buchbinder (10.1016/j.tcs.2023.114293_br0300) 2019 Feige (10.1016/j.tcs.2023.114293_br0080) 1998; 45 Fadaei (10.1016/j.tcs.2023.114293_br0260) 2011; 39 Khanna (10.1016/j.tcs.2023.114293_br0060) 2017; vol. 54 Gupta (10.1016/j.tcs.2023.114293_br0200) 2010; vol. 6484 Buchbinder (10.1016/j.tcs.2023.114293_br0220) 2014 Sviridenko (10.1016/j.tcs.2023.114293_br0120) 2004; 32 |
| References_xml | – start-page: 137 year: 2003 ident: 10.1016/j.tcs.2023.114293_br0010 article-title: Maximizing the spread of influence through a social network – start-page: 407 year: 2012 ident: 10.1016/j.tcs.2023.114293_br0020 article-title: Algorithms for approximate minimization of the difference between submodular functions, with applications – start-page: 67 year: 2008 ident: 10.1016/j.tcs.2023.114293_br0130 article-title: Optimal approximation for the submodular welfare problem in the value oracle model – start-page: 1433 year: 2014 ident: 10.1016/j.tcs.2023.114293_br0220 article-title: Submodular maximization with cardinality constraints – start-page: 570 year: 2011 ident: 10.1016/j.tcs.2023.114293_br0150 article-title: A unified continuous greedy algorithm for submodular maximization – volume: 2 start-page: 32:1 issue: 4 year: 2011 ident: 10.1016/j.tcs.2023.114293_br0040 article-title: Submodularity and its applications in optimized information gathering publication-title: ACM Trans. Intell. Syst. Technol. doi: 10.1145/1989734.1989736 – start-page: 545 year: 2009 ident: 10.1016/j.tcs.2023.114293_br0140 article-title: Maximizing submodular set functions subject to multiple linear constraints – start-page: 241 year: 2019 ident: 10.1016/j.tcs.2023.114293_br0300 article-title: Deterministic (½ + ϵ)-approximation for submodular maximization over a matroid – volume: 39 start-page: 447 year: 2011 ident: 10.1016/j.tcs.2023.114293_br0260 article-title: Maximizing non-monotone submodular set functions subject to different constraints: combined algorithms publication-title: Oper. Res. Lett. doi: 10.1016/j.orl.2011.10.002 – volume: vol. 54 start-page: 1560 year: 2017 ident: 10.1016/j.tcs.2023.114293_br0060 article-title: Scalable greedy feature selection via weak submodularity – volume: 44 start-page: 988 issue: 3 year: 2019 ident: 10.1016/j.tcs.2023.114293_br0170 article-title: Constrained submodular maximization via a nonsymmetric technique publication-title: Math. Oper. Res. doi: 10.1287/moor.2018.0955 – year: 2003 ident: 10.1016/j.tcs.2023.114293_br0270 – start-page: 2436 year: 2013 ident: 10.1016/j.tcs.2023.114293_br0030 article-title: Submodular optimization with submodular cover and submodular knapsack constraints – volume: 14 start-page: 265 issue: 1 year: 1978 ident: 10.1016/j.tcs.2023.114293_br0090 article-title: An analysis of approximations for maximizing submodular set functions - I publication-title: Math. Program. doi: 10.1007/BF01588971 – volume: 45 start-page: 634 issue: 4 year: 1998 ident: 10.1016/j.tcs.2023.114293_br0080 article-title: A threshold of ln n for approximating set cover publication-title: J. ACM doi: 10.1145/285055.285059 – volume: 3 start-page: 177 issue: 3 year: 1978 ident: 10.1016/j.tcs.2023.114293_br0070 article-title: Best algorithms for approximating the maximum of a submodular set function publication-title: Math. Oper. Res. doi: 10.1287/moor.3.3.177 – start-page: 901 year: 2019 ident: 10.1016/j.tcs.2023.114293_br0210 article-title: Budget-feasible mechanism design for non-monotone submodular objectives: offline and online – volume: 70 start-page: 39 year: 1999 ident: 10.1016/j.tcs.2023.114293_br0110 article-title: The budgeted maximum coverage problem publication-title: Inf. Process. Lett. doi: 10.1016/S0020-0190(99)00031-9 – volume: vol. 6484 start-page: 246 year: 2010 ident: 10.1016/j.tcs.2023.114293_br0200 article-title: Constrained non-monotone submodular maximization: offline and secretary algorithms – volume: vol. 7391 start-page: 38 year: 2012 ident: 10.1016/j.tcs.2023.114293_br0290 article-title: Efficient submodular function maximization under linear packing constraints – start-page: 45 year: 2008 ident: 10.1016/j.tcs.2023.114293_br0050 article-title: Algorithms for subset selection in linear regression – volume: 32 start-page: 41 issue: 1 year: 2004 ident: 10.1016/j.tcs.2023.114293_br0120 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 – volume: vol. 48 start-page: 1358 year: 2016 ident: 10.1016/j.tcs.2023.114293_br0230 article-title: Fast constrained submodular maximization: personalized data summarization – start-page: 430 year: 2020 ident: 10.1016/j.tcs.2023.114293_br0190 article-title: Deterministic approximation for submodular maximization over a matroid in nearly linear time – volume: 23 start-page: 2053 year: 2010 ident: 10.1016/j.tcs.2023.114293_br0240 article-title: Maximizing nonmonotone submodular functions under matroid or knapsack constraints publication-title: SIAM J. Discrete Math. doi: 10.1137/090750020 – start-page: 16903 year: 2020 ident: 10.1016/j.tcs.2023.114293_br0250 article-title: Fast adaptive non-monotone submodular maximization subject to a knapsack constraint – volume: 14 start-page: 32:1 issue: 3 year: 2018 ident: 10.1016/j.tcs.2023.114293_br0180 article-title: Deterministic algorithms for submodular maximization problems publication-title: ACM Trans. Algorithms doi: 10.1145/3184990 – start-page: 1497 year: 2014 ident: 10.1016/j.tcs.2023.114293_br0280 article-title: Fast algorithms for maximizing submodular functions – start-page: 73 year: 1978 ident: 10.1016/j.tcs.2023.114293_br0100 article-title: An analysis of approximations for maximizing submodular set functions - II – start-page: 1098 year: 2011 ident: 10.1016/j.tcs.2023.114293_br0160 article-title: Submodular maximization by simulated annealing |
| SSID | ssj0000576 |
| Score | 2.4386199 |
| SourceID | crossref |
| SourceType | Enrichment Source Index Database |
| StartPage | 114293 |
| Title | Improved deterministic algorithms for non-monotone submodular maximization |
| Volume | 984 |
| WOSCitedRecordID | wos001133492900001&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 issn: 0304-3975 databaseCode: AIEXJ dateStart: 20211209 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://www.sciencedirect.com omitProxy: false ssIdentifier: ssj0000576 providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3PT9swFLY64DAOjLFNgw3kw05URk2cxPERTUyjEmjSilRxiVzbWVO1DWoD6p_Pc-w0hgppHLhEleW6bt_r-2G_930I_TCIJyaRJukoDkmkZU44oxFhMk9yQwefUFGTTbDr63Q45H86nbzphXmYsvk8Xa343ZuKGsZA2KZ19hXiXi8KA_AahA5PEDs8_0vw9pgA4kjlKl1qKOaumP4rF0U1tgAMXcj6CWypNFjc3SU4xVLVBakzsSpmrjfTD1wHXsOjdEwQXec-24ul2oQNC1HOGo_on0n34csX843hv-P7cmPwdlxMCu2fSYQRqRlSPNNFzX0Lt5wojZ3laeRZStPDa7kRN4y4PU-YnFXS4KmH9Kyd-xQw-5kjW5cXNpVrkwyWyMwSmV3iHdoOWczB-m2fX14M-63Pjpm91Xb7bu6_60rAZ_vwIhgvFBnsoz2XQ-BzK_uPqKPnB-hDw8-Bnbk-QLtXa0ze5SfUbxQDP1EM3CoGBsXAvmLgVjGwrxif0c2vi8HP38QxaRAZRnFFFBNJICgTNEmV4r2ehD8kG4UJBGtUSy2CQFMNsSBXMVU0SYQMVErTHJLRYBQr-gVtwcfrrwjHQZr3uIpyHrIo1xwyYpXImEZ0xIyzOkS95tfJpIOZN2wn0-xFqRyi0_Vb7izGysuTj14z-Rt636rnd7RVLe71MdqRD1WxXJw4JXgEM492lw |
| 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=Improved+deterministic+algorithms+for+non-monotone+submodular+maximization&rft.jtitle=Theoretical+computer+science&rft.au=Sun%2C+Xiaoming&rft.au=Zhang%2C+Jialin&rft.au=Zhang%2C+Shuo&rft.au=Zhang%2C+Zhijie&rft.date=2024-02-12&rft.issn=0304-3975&rft.volume=984&rft.spage=114293&rft_id=info:doi/10.1016%2Fj.tcs.2023.114293&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_tcs_2023_114293 |
| 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 |