Greedy+Singleton: An efficient approximation algorithm for k-submodular knapsack maximization
Uloženo v:
| Vydáno v: | Theoretical computer science Ročník 984; s. 114320 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
12.02.2024
|
| ISSN: | 0304-3975 |
| 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!
|
| ArticleNumber | 114320 |
|---|---|
| Author | Wang, Chenhao Tang, Zhongzheng Chen, Jingwen |
| Author_xml | – sequence: 1 givenname: Zhongzheng surname: Tang fullname: Tang, Zhongzheng – sequence: 2 givenname: Jingwen surname: Chen fullname: Chen, Jingwen – sequence: 3 givenname: Chenhao orcidid: 0000-0002-2481-5648 surname: Wang fullname: Wang, Chenhao |
| BookMark | eNp9kE1LAzEQhnOoYFv9Ad5yl12T7EdSb6VoFQoe1KOESZqtaXeTJUnB-uvdtp48OJdh4H2Gl2eCRs47g9ANJTkltL7b5knHnBFW5JSWBSMjNCYFKbNixqtLNIlxS4apeD1GH8tgzPpw-2rdpjXJu3s8d9g0jdXWuISh74P_sh0k6x2GduODTZ8dbnzAuyzuVefX-xaGw0EfQe9wB0Pcfp-AK3TRQBvN9e-eovfHh7fFU7Z6WT4v5qtM05qkTClmKAAXZSUYFVoAmNqUDAphSq4McMJqXaxppUQ9o1xVwlSloESphqshNkX0_FcHH2MwjezD0DkcJCXy6ERu5eBEHp3Is5OB4X8YbdOpdQpg23_IH_cVbjc |
| CitedBy_id | crossref_primary_10_1016_j_eswa_2025_127568 |
| Cites_doi | 10.1137/15M101926X 10.1145/3447386 10.1007/s10878-022-00858-x 10.1016/j.orl.2021.04.006 10.1016/j.tcs.2022.04.003 10.1287/moor.7.3.410 10.1016/S0020-0190(99)00031-9 10.1016/j.disopt.2017.01.003 10.1016/j.ipl.2008.03.017 10.1137/19M1277692 10.1145/2850419 10.1016/j.orl.2021.11.010 10.1007/s10878-023-01021-w 10.1016/S0167-6377(03)00062-2 10.1016/j.disopt.2021.100670 |
| ContentType | Journal Article |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.tcs.2023.114320 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Computer Science |
| ExternalDocumentID | 10_1016_j_tcs_2023_114320 |
| 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-c160t-bb2e1aa78458218c8aae6e42a38e47bea7026c3d15b86917b58e54810bbf7b2a3 |
| ISSN | 0304-3975 |
| IngestDate | Sat Nov 29 07:20:16 EST 2025 Tue Nov 18 22:18:58 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c160t-bb2e1aa78458218c8aae6e42a38e47bea7026c3d15b86917b58e54810bbf7b2a3 |
| ORCID | 0000-0002-2481-5648 |
| ParticipantIDs | crossref_primary_10_1016_j_tcs_2023_114320 crossref_citationtrail_10_1016_j_tcs_2023_114320 |
| 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 | Pham (10.1016/j.tcs.2023.114320_br0160) 2022; 44 Chen (10.1016/j.tcs.2023.114320_br0010) 2022 Wang (10.1016/j.tcs.2023.114320_br0260) Tang (10.1016/j.tcs.2023.114320_br0220) 2023 Tang (10.1016/j.tcs.2023.114320_br0330) 2023 Tang (10.1016/j.tcs.2023.114320_br0250) 2022; 50 Ward (10.1016/j.tcs.2023.114320_br0270) 2016; 12 Ene (10.1016/j.tcs.2023.114320_br0030) 2022 Tang (10.1016/j.tcs.2023.114320_br0210) 2021; 5 Lin (10.1016/j.tcs.2023.114320_br0120) 2010 Sviridenko (10.1016/j.tcs.2023.114320_br0200) 2004; 32 Gridchyn (10.1016/j.tcs.2023.114320_br0050) 2013 Kudla (10.1016/j.tcs.2023.114320_br0100) Khuller (10.1016/j.tcs.2023.114320_br0090) 1999; 70 Tang (10.1016/j.tcs.2023.114320_br0240) 2022; 921 Yu (10.1016/j.tcs.2023.114320_br0320) 2021; 42 Feldman (10.1016/j.tcs.2023.114320_br0040) 2022 Oshima (10.1016/j.tcs.2023.114320_br0150) 2021; 35 Soma (10.1016/j.tcs.2023.114320_br0180) 2019 Xiao (10.1016/j.tcs.2023.114320_br0290) Cohen (10.1016/j.tcs.2023.114320_br0020) 2008; 108 Hirai (10.1016/j.tcs.2023.114320_br0060) 2016; 30 Sakaue (10.1016/j.tcs.2023.114320_br0170) 2017; 23 Yu (10.1016/j.tcs.2023.114320_br0310) 2023; 45 Nguyen (10.1016/j.tcs.2023.114320_br0130) 2020 Ohsaka (10.1016/j.tcs.2023.114320_br0140) 2015 Kulik (10.1016/j.tcs.2023.114320_br0110) 2021; 49 Sun (10.1016/j.tcs.2023.114320_br0190) 2023 Wolsey (10.1016/j.tcs.2023.114320_br0280) 1982; 7 Yu (10.1016/j.tcs.2023.114320_br0300) 2022 Iwata (10.1016/j.tcs.2023.114320_br0080) 2016 Huber (10.1016/j.tcs.2023.114320_br0070) 2012 |
| References_xml | – volume: 30 start-page: 1726 issue: 3 year: 2016 ident: 10.1016/j.tcs.2023.114320_br0060 article-title: On k-submodular relaxation publication-title: SIAM J. Discrete Math. doi: 10.1137/15M101926X – start-page: 156 year: 2022 ident: 10.1016/j.tcs.2023.114320_br0300 article-title: Guarantees for maximization of k-submodular functions with a knapsack and a matroid constraint – volume: 5 start-page: 1 issue: 1 year: 2021 ident: 10.1016/j.tcs.2023.114320_br0210 article-title: Revisiting modified greedy algorithm for monotone submodular maximization with a knapsack constraint publication-title: Proc. ACM Meas. Anal. Comput. Syst. doi: 10.1145/3447386 – volume: 44 start-page: 723 issue: 1 year: 2022 ident: 10.1016/j.tcs.2023.114320_br0160 article-title: Maximizing k-submodular functions under budget constraint: applications and streaming algorithms publication-title: J. Comb. Optim. doi: 10.1007/s10878-022-00858-x – volume: 49 start-page: 507 issue: 4 year: 2021 ident: 10.1016/j.tcs.2023.114320_br0110 article-title: A refined analysis of submodular greedy publication-title: Oper. Res. Lett. doi: 10.1016/j.orl.2021.04.006 – start-page: 694 year: 2015 ident: 10.1016/j.tcs.2023.114320_br0140 article-title: Monotone k-submodular function maximization with size constraints – start-page: 1205 year: 2019 ident: 10.1016/j.tcs.2023.114320_br0180 article-title: No-regret algorithms for online k-submodular maximization – start-page: 1 year: 2022 ident: 10.1016/j.tcs.2023.114320_br0040 article-title: Practical budgeted submodular maximization publication-title: Algorithmica – start-page: 912 year: 2010 ident: 10.1016/j.tcs.2023.114320_br0120 article-title: Multi-document summarization via budgeted maximization of submodular functions – volume: 921 start-page: 86 year: 2022 ident: 10.1016/j.tcs.2023.114320_br0240 article-title: Monotone k-submodular secretary problems: cardinality and knapsack constraints publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2022.04.003 – ident: 10.1016/j.tcs.2023.114320_br0260 – year: 2023 ident: 10.1016/j.tcs.2023.114320_br0220 article-title: An improved analysis of the greedy+singleton algorithm for k-submodular knapsack maximization – start-page: 1 year: 2023 ident: 10.1016/j.tcs.2023.114320_br0190 article-title: Maximization of k-submodular function with a matroid constraint – start-page: 7338 year: 2020 ident: 10.1016/j.tcs.2023.114320_br0130 article-title: Streaming k-submodular maximization under noise subject to size constraint – volume: 7 start-page: 410 issue: 3 year: 1982 ident: 10.1016/j.tcs.2023.114320_br0280 article-title: Maximising real-valued submodular functions: primal and dual heuristics for location problems publication-title: Math. Oper. Res. doi: 10.1287/moor.7.3.410 – ident: 10.1016/j.tcs.2023.114320_br0100 – volume: 70 start-page: 39 issue: 1 year: 1999 ident: 10.1016/j.tcs.2023.114320_br0090 article-title: The budgeted maximum coverage problem publication-title: Inf. Process. Lett. doi: 10.1016/S0020-0190(99)00031-9 – volume: 23 start-page: 105 year: 2017 ident: 10.1016/j.tcs.2023.114320_br0170 article-title: On maximizing a monotone k-submodular function subject to a matroid constraint publication-title: Discrete Optim. doi: 10.1016/j.disopt.2017.01.003 – start-page: 451 year: 2012 ident: 10.1016/j.tcs.2023.114320_br0070 article-title: Towards minimizing k-submodular functions – volume: 108 start-page: 15 issue: 1 year: 2008 ident: 10.1016/j.tcs.2023.114320_br0020 article-title: The generalized maximum coverage problem publication-title: Inf. Process. Lett. doi: 10.1016/j.ipl.2008.03.017 – volume: 35 start-page: 1 issue: 1 year: 2021 ident: 10.1016/j.tcs.2023.114320_br0150 article-title: Improved randomized algorithm for k-submodular function maximization publication-title: SIAM J. Discrete Math. doi: 10.1137/19M1277692 – ident: 10.1016/j.tcs.2023.114320_br0290 – start-page: 2338 year: 2023 ident: 10.1016/j.tcs.2023.114320_br0330 article-title: Improved analysis of greedy algorithm on k-submodular knapsack – start-page: 144 year: 2022 ident: 10.1016/j.tcs.2023.114320_br0010 article-title: Monotone k-submodular knapsack maximization: an analysis of the greedy+ singleton algorithm – volume: 12 start-page: 1 issue: 4 year: 2016 ident: 10.1016/j.tcs.2023.114320_br0270 article-title: Maximizing k-submodular functions and beyond publication-title: ACM Trans. Algorithms doi: 10.1145/2850419 – start-page: 5944 year: 2022 ident: 10.1016/j.tcs.2023.114320_br0030 article-title: Streaming algorithm for monotone k-submodular maximization with cardinality constraints – volume: 50 start-page: 28 issue: 1 year: 2022 ident: 10.1016/j.tcs.2023.114320_br0250 article-title: On maximizing a monotone k-submodular function under a knapsack constraint publication-title: Oper. Res. Lett. doi: 10.1016/j.orl.2021.11.010 – volume: 45 start-page: 1 issue: 3 year: 2023 ident: 10.1016/j.tcs.2023.114320_br0310 article-title: On maximizing monotone or non-monotone k-submodular functions with the intersection of knapsack and matroid constraints publication-title: J. Comb. Optim. doi: 10.1007/s10878-023-01021-w – start-page: 2320 year: 2013 ident: 10.1016/j.tcs.2023.114320_br0050 article-title: Potts model, parametric maxflow and k-submodular functions – volume: 32 start-page: 41 issue: 1 year: 2004 ident: 10.1016/j.tcs.2023.114320_br0200 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: 42 year: 2021 ident: 10.1016/j.tcs.2023.114320_br0320 article-title: An exact cutting plane method for k-submodular function maximization publication-title: Discrete Optim. doi: 10.1016/j.disopt.2021.100670 – start-page: 404 year: 2016 ident: 10.1016/j.tcs.2023.114320_br0080 article-title: Improved approximation algorithms for k-submodular function maximization |
| SSID | ssj0000576 |
| Score | 2.404281 |
| SourceID | crossref |
| SourceType | Enrichment Source Index Database |
| StartPage | 114320 |
| Title | Greedy+Singleton: An efficient approximation algorithm for k-submodular knapsack maximization |
| Volume | 984 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 issn: 0304-3975 databaseCode: AIEXJ dateStart: 20211207 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/eLvHCXMwtV1Lb9QwELag5QCHAgVEeckHTqxSbZ52uG2rIkBQIbHACglFtuPtbrd1VpsUVv31HT-SuEWV6IGLFSUTy8p8mfF4Xgi9TtMy5gCVQJRgqyZlBv-cICxIch6nAqwxarJcv38ih4d0Msm_OA9-bdoJEKXoep0v_yur4R4wW6fO3oDd3aRwA66B6TAC22H8J8brSBotOfe-glYCrtjYjZHSoRtzk_5oC4mv5zZrccBOjqrVvJmdmpDDRVCDiqxKE566UGxZM7EYnDIgdymb_n527OVBCtcgYuC0an8oYOXJz1mljs5n0ulKE1PgUkNgpX_6nLQf7gX9eMYq_2AiSgLTJsWTX7F2uuS2MUorbHOaeOISjLHY5ML9LcntocLxbiN0UfUo3u1pL1fNvqLNuhjDNnztuIApCj1FYae4jTYjkuYgAjdHHw4mH3vFnRLr2nbrbp3gJhzwyjq8bYy3Hxk_QFvOkMAjC4CH6JZU2-h-26QDO5m9je597grz1o_QL4uOQYeNt3ikcIcMfAkZuEMGBmRgHxm4RQb2kfEYfXt3MN5_H7gOG4EIs2ETcB7JkDFCtfc0pIIyJjOZRCymMiFcMgImuojLMOU0A8Oep1SCiRsOOZ8SDmRP0IaqlHyKME9KmqdcRCRiCZmWFJQFo1OayQx-e0520LD9YIVw5ed1F5ST4lpG7aA33StLW3vleuJnNyF-ju72iH2BNprVmXyJ7ojfzbxevXK4uACaz3-u |
| 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=Greedy%2BSingleton%3A+An+efficient+approximation+algorithm+for+k-submodular+knapsack+maximization&rft.jtitle=Theoretical+computer+science&rft.au=Tang%2C+Zhongzheng&rft.au=Chen%2C+Jingwen&rft.au=Wang%2C+Chenhao&rft.date=2024-02-12&rft.issn=0304-3975&rft.volume=984&rft.spage=114320&rft_id=info:doi/10.1016%2Fj.tcs.2023.114320&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_tcs_2023_114320 |
| 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 |