{"id":"https://openalex.org/W4388405355","doi":"https://doi.org/10.1109/kse59128.2023.10299445","title":"Robust Approximation Algorithms for Non-Monotone k-Submodular Maximization Under a Knapsack Constraint","display_name":"Robust Approximation Algorithms for Non-Monotone k-Submodular Maximization Under a Knapsack Constraint","publication_year":2023,"publication_date":"2023-10-18","ids":{"openalex":"https://openalex.org/W4388405355","doi":"https://doi.org/10.1109/kse59128.2023.10299445"},"language":"en","primary_location":{"id":"doi:10.1109/kse59128.2023.10299445","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/kse59128.2023.10299445","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 15th International Conference on Knowledge and Systems Engineering (KSE)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5073998124","display_name":"Dung T. K. Ha","orcid":"https://orcid.org/0000-0001-8375-7866"},"institutions":[{"id":"https://openalex.org/I67868205","display_name":"VNU University of Science","ror":"https://ror.org/05w54hk79","country_code":"VN","type":"education","lineage":["https://openalex.org/I177233841","https://openalex.org/I67868205"]}],"countries":["VN"],"is_corresponding":true,"raw_author_name":"Dung T.K. Ha","raw_affiliation_strings":["VNU University of Engineering and Technology,Faculty of Information Technology,Hanoi,Vietnam","Faculty of Information Technology, VNU University of Engineering and Technology, Hanoi, Vietnam"],"affiliations":[{"raw_affiliation_string":"VNU University of Engineering and Technology,Faculty of Information Technology,Hanoi,Vietnam","institution_ids":["https://openalex.org/I67868205"]},{"raw_affiliation_string":"Faculty of Information Technology, VNU University of Engineering and Technology, Hanoi, Vietnam","institution_ids":["https://openalex.org/I67868205"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5021107068","display_name":"Canh V. Pham","orcid":"https://orcid.org/0000-0002-8118-1768"},"institutions":[{"id":"https://openalex.org/I4210124651","display_name":"Phenikaa University","ror":"https://ror.org/03anxx281","country_code":"VN","type":"education","lineage":["https://openalex.org/I4210124651"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Canh V. Pham","raw_affiliation_strings":["Phenikaa University,ORLab,Hanoi,Vietnam","ORLab, Phenikaa University, Hanoi, Vietnam"],"affiliations":[{"raw_affiliation_string":"Phenikaa University,ORLab,Hanoi,Vietnam","institution_ids":["https://openalex.org/I4210124651"]},{"raw_affiliation_string":"ORLab, Phenikaa University, Hanoi, Vietnam","institution_ids":["https://openalex.org/I4210124651"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Tan D. Tran","orcid":null},"institutions":[{"id":"https://openalex.org/I67868205","display_name":"VNU University of Science","ror":"https://ror.org/05w54hk79","country_code":"VN","type":"education","lineage":["https://openalex.org/I177233841","https://openalex.org/I67868205"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Tan D. Tran","raw_affiliation_strings":["VNU University of Engineering and Technology,Faculty of Information Technology,Hanoi,Vietnam","Faculty of Information Technology, VNU University of Engineering and Technology, Hanoi, Vietnam"],"affiliations":[{"raw_affiliation_string":"VNU University of Engineering and Technology,Faculty of Information Technology,Hanoi,Vietnam","institution_ids":["https://openalex.org/I67868205"]},{"raw_affiliation_string":"Faculty of Information Technology, VNU University of Engineering and Technology, Hanoi, Vietnam","institution_ids":["https://openalex.org/I67868205"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5023647074","display_name":"Huan X. Hoang","orcid":null},"institutions":[{"id":"https://openalex.org/I67868205","display_name":"VNU University of Science","ror":"https://ror.org/05w54hk79","country_code":"VN","type":"education","lineage":["https://openalex.org/I177233841","https://openalex.org/I67868205"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Huan X. Hoang","raw_affiliation_strings":["Halong University,Faculty of Information Technology,Quang Ninh,Vietnam","Faculty of Information Technology, VNU University of Engineering and Technology, Hanoi, Vietnam","Faculty of Information Technology, Halong University, Quang Ninh, Vietnam"],"affiliations":[{"raw_affiliation_string":"Halong University,Faculty of Information Technology,Quang Ninh,Vietnam","institution_ids":[]},{"raw_affiliation_string":"Faculty of Information Technology, VNU University of Engineering and Technology, Hanoi, Vietnam","institution_ids":["https://openalex.org/I67868205"]},{"raw_affiliation_string":"Faculty of Information Technology, Halong University, Quang Ninh, Vietnam","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5073998124"],"corresponding_institution_ids":["https://openalex.org/I67868205"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.22081715,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"48","issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9926000237464905,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.7144699096679688},{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.6677752733230591},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.6013333797454834},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5205172896385193},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5114978551864624},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5038644671440125},{"id":"https://openalex.org/keywords/automatic-summarization","display_name":"Automatic summarization","score":0.4978039264678955},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.4807274639606476},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4393864870071411},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.37829267978668213},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35716956853866577},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34340858459472656},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32706478238105774},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.29963207244873047},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2260056436061859}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.7144699096679688},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.6677752733230591},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.6013333797454834},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5205172896385193},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5114978551864624},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5038644671440125},{"id":"https://openalex.org/C170858558","wikidata":"https://www.wikidata.org/wiki/Q1394144","display_name":"Automatic summarization","level":2,"score":0.4978039264678955},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.4807274639606476},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4393864870071411},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.37829267978668213},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35716956853866577},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34340858459472656},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32706478238105774},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.29963207244873047},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2260056436061859},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/kse59128.2023.10299445","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/kse59128.2023.10299445","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 15th International Conference on Knowledge and Systems Engineering (KSE)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1498671329","https://openalex.org/W2033885045","https://openalex.org/W2053381548","https://openalex.org/W2129919379","https://openalex.org/W2160411082","https://openalex.org/W2182880825","https://openalex.org/W2473929617","https://openalex.org/W2545520746","https://openalex.org/W2755088640","https://openalex.org/W2883800358","https://openalex.org/W2950365512","https://openalex.org/W2952201503","https://openalex.org/W3008500873","https://openalex.org/W3035099254","https://openalex.org/W3037630572","https://openalex.org/W3136549045","https://openalex.org/W3171608239","https://openalex.org/W4223972941","https://openalex.org/W4232212779","https://openalex.org/W4319783626","https://openalex.org/W6679453101","https://openalex.org/W6686400581","https://openalex.org/W6720980371","https://openalex.org/W6729399602","https://openalex.org/W6753217642","https://openalex.org/W6779918837","https://openalex.org/W6779948498"],"related_works":["https://openalex.org/W2963844234","https://openalex.org/W2803250016","https://openalex.org/W2923536170","https://openalex.org/W2950365512","https://openalex.org/W1608444752","https://openalex.org/W2098281589","https://openalex.org/W3204684126","https://openalex.org/W2062310236","https://openalex.org/W3013568067","https://openalex.org/W3155769677"],"abstract_inverted_index":{"The":[0,107,191],"problem":[1,45,81],"of":[2,49,66,70,88,99,209],"non-monotone":[3,54,151],"<tex":[4,13,21,102,116,120,125,144,162],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[5,14,22,103,117,121,126,145,163],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$k$</tex>":[6],"-submodular":[7],"maximization":[8],"under":[9],"a":[10,61,161],"knapsack":[11],"constraint":[12],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$(\\text{kSMK})$</tex>":[15],"over":[16],"the":[17,44,53,67,80,85,112,134,150,168,189,201,207],"ground":[18],"set":[19],"size":[20,69],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$n$</tex>":[23],"has":[24],"been":[25],"raised":[26],"in":[27,30,64,119,180],"many":[28],"applications":[29],"machine":[31],"learning,":[32],"such":[33],"as":[34,200],"data":[35],"summarization,":[36],"information":[37],"propagation,":[38],"etc.":[39],"However,":[40],"existing":[41,89],"algorithms":[42,78,132,196],"for":[43,79,149,188],"are":[46,133],"facing":[47],"questioning":[48],"how":[50,57],"to":[51,58,115],"overcome":[52],"case":[55,65],"and":[56,185,204],"fast":[59],"return":[60],"good":[62],"solution":[63],"immense":[68],"data.":[71],"This":[72],"paper":[73],"introduces":[74],"two":[75],"deterministic":[76],"approximation":[77,97,113,140],"that":[82,137,194],"competitively":[83],"improve":[84],"query":[86,105,147],"complexity":[87,148],"ones.":[90],"Our":[91,131],"first":[92,135],"algorithm,":[93],"LAA,":[94],"returns":[95],"an":[96,129],"ratio":[98,114],"1/19":[100],"within":[101,142],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$O(nk)$</tex>":[104,122,146],"complexity.":[106],"second":[108],"one,":[109],"RLA,":[110],"improves":[111],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$1/5-\\epsilon$</tex>":[118],"queries,":[123],"where":[124],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\epsilon$</tex>":[127],"is":[128],"input.":[130],"ones":[136,176],"provide":[138],"constant":[139],"ratios":[141],"only":[143],"objective.":[152],"Therefore,":[153],"they":[154],"need":[155],"fewer":[156],"queries":[157],"than":[158],"state-of-the-the-art":[159],"by":[160],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\Omega(\\log":[164],"n)$</tex>":[165],"factor.":[166],"Besides":[167],"theoretical":[169,198],"analysis,":[170],"we":[171],"have":[172],"evaluated":[173],"our":[174,195],"proposed":[175],"with":[177],"several":[178],"experiments":[179],"some":[181],"instances:":[182],"Influence":[183],"Maximization":[184],"Sensor":[186],"Placement":[187],"problem.":[190],"results":[192],"confirm":[193],"ensure":[197],"quality":[199],"cutting-edge":[202],"techniques":[203],"significantly":[205],"reduce":[206],"number":[208],"queries.":[210]},"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}