{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T09:28:42Z","timestamp":1730280522987,"version":"3.28.0"},"reference-count":23,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,10,18]],"date-time":"2023-10-18T00:00:00Z","timestamp":1697587200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,10,18]],"date-time":"2023-10-18T00:00:00Z","timestamp":1697587200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,10,18]]},"DOI":"10.1109\/kse59128.2023.10299445","type":"proceedings-article","created":{"date-parts":[[2023,11,6]],"date-time":"2023-11-06T19:05:46Z","timestamp":1699297546000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["Robust Approximation Algorithms for Non-Monotone k-Submodular Maximization Under a Knapsack Constraint"],"prefix":"10.1109","author":[{"given":"Dung T.K.","family":"Ha","sequence":"first","affiliation":[{"name":"VNU University of Engineering and Technology,Faculty of Information Technology,Hanoi,Vietnam"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Canh V.","family":"Pham","sequence":"additional","affiliation":[{"name":"Phenikaa University,ORLab,Hanoi,Vietnam"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tan D.","family":"Tran","sequence":"additional","affiliation":[{"name":"VNU University of Engineering and Technology,Faculty of Information Technology,Hanoi,Vietnam"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huan X.","family":"Hoang","sequence":"additional","affiliation":[{"name":"Halong University,Faculty of Information Technology,Quang Ninh,Vietnam"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref13","first-page":"1358","article-title":"Fast constrained submodular maximization: Personalized data summarization","volume":"48","author":"mirzasoleiman","year":"2016","journal-title":"Proc of ICML 2016"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1137\/1.9781611973730.77"},{"year":"2004","author":"bodik","journal-title":"The Intel Lab","key":"ref23"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1137\/1.9781611974331.ch30"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1007\/s10878-022-00858-x"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1016\/S0167-6377(03)00062-2"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1137\/090779346"},{"year":"2014","author":"leskovec","journal-title":"SNAP Datasets Stanford large network dataset collection","key":"ref22"},{"key":"ref10","article-title":"Multilinear extension of k-submodular functions","volume":"abs 2107 7103","author":"wang","year":"2021","journal-title":"CoRR"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1137\/1.9781611973402.70"},{"key":"ref2","first-page":"1055","article-title":"On bisubmodular maximization","author":"singh","year":"2012","journal-title":"Proc of AISTATS 2012"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1007\/978-3-642-68874-4_10"},{"key":"ref17","first-page":"694","article-title":"Monotone k-submodular function maximization with size constraints","author":"ohsaka","year":"2015","journal-title":"Proc of NIPS 2015"},{"key":"ref16","first-page":"88","article-title":"Derandomization for k-submodular maximization","author":"oshima","year":"2017","journal-title":"In Proc of IWOCA"},{"key":"ref19","first-page":"7887","article-title":"Fast and private submodular and k-submodular functions maximization with matroid constraints","author":"rafiey","year":"0","journal-title":"Proc of ICML 2020"},{"key":"ref18","first-page":"1205","article-title":"No-regret algorithms for online k-submodular maximization","author":"soma","year":"0","journal-title":"Proc of AISTATS 2019"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1145\/956755.956769"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1109\/DSAA54385.2022.10032383"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1016\/j.orl.2021.11.010"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1109\/GLOBECOM38437.2019.9013859"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1137\/1.9781611973402.108"},{"key":"ref6","first-page":"7338","article-title":"Streaming k-submodular maximization under noise subject to size constraint","author":"nguyen","year":"2020","journal-title":"Proc of ICML 2020"},{"key":"ref5","first-page":"7887","article-title":"Fast and private submodular and k-submodular functions maximization with matroid constraints","author":"rafiey","year":"2020","journal-title":"Proc of ICML 2020"}],"event":{"name":"2023 15th International Conference on Knowledge and Systems Engineering (KSE)","start":{"date-parts":[[2023,10,18]]},"location":"Hanoi, Vietnam","end":{"date-parts":[[2023,10,20]]}},"container-title":["2023 15th International Conference on Knowledge and Systems Engineering (KSE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10298834\/10298844\/10299445.pdf?arnumber=10299445","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,11]],"date-time":"2023-12-11T19:11:02Z","timestamp":1702321862000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10299445\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,18]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/kse59128.2023.10299445","relation":{},"subject":[],"published":{"date-parts":[[2023,10,18]]}}}