{"id":"https://openalex.org/W4319783626","doi":"https://doi.org/10.1109/dsaa54385.2022.10032383","title":"Fast Streaming Algorithms for k-Submodular Maximization under a Knapsack Constraint","display_name":"Fast Streaming Algorithms for k-Submodular Maximization under a Knapsack Constraint","publication_year":2022,"publication_date":"2022-10-13","ids":{"openalex":"https://openalex.org/W4319783626","doi":"https://doi.org/10.1109/dsaa54385.2022.10032383"},"language":"en","primary_location":{"id":"doi:10.1109/dsaa54385.2022.10032383","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dsaa54385.2022.10032383","pdf_url":null,"source":{"id":"https://openalex.org/S4363608340","display_name":"2022 IEEE 9th International Conference on Data Science and Advanced Analytics (DSAA)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE 9th International Conference on Data Science and Advanced Analytics (DSAA)","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/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":true,"raw_author_name":"Canh V. Pham","raw_affiliation_strings":["Phenikaa University,ORLab, Faculty of Computer Science,Hanoi,Vietnam","ORLab, Faculty of Computer Science, Phenikaa University, Hanoi, Vietnam"],"affiliations":[{"raw_affiliation_string":"Phenikaa University,ORLab, Faculty of Computer Science,Hanoi,Vietnam","institution_ids":["https://openalex.org/I4210124651"]},{"raw_affiliation_string":"ORLab, Faculty of Computer Science, Phenikaa University, Hanoi, Vietnam","institution_ids":["https://openalex.org/I4210124651"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063401160","display_name":"Dung K. T. Ha","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":"Dung K.T. 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/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"]},{"id":"https://openalex.org/I3132161128","display_name":"Hai Phong University","ror":"https://ror.org/0227kwk61","country_code":"VN","type":"education","lineage":["https://openalex.org/I3132161128"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Huan X. Hoang","raw_affiliation_strings":["Halong University,Faculty of Information Technology,Vietnam","VNU University of Engineering and Technology, Ha Noi, Vietnam","Faculty of Information Technology, Halong University, Vietnam"],"affiliations":[{"raw_affiliation_string":"Halong University,Faculty of Information Technology,Vietnam","institution_ids":["https://openalex.org/I3132161128"]},{"raw_affiliation_string":"VNU University of Engineering and Technology, Ha Noi, Vietnam","institution_ids":["https://openalex.org/I67868205"]},{"raw_affiliation_string":"Faculty of Information Technology, Halong University, Vietnam","institution_ids":["https://openalex.org/I3132161128"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061790610","display_name":"Duc\u2013Tan Tran","orcid":"https://orcid.org/0000-0002-7673-388X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tan D. Tran","raw_affiliation_strings":["People’s Security Academy,Hanoi,Vietnam"],"affiliations":[{"raw_affiliation_string":"People’s Security Academy,Hanoi,Vietnam","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5021107068"],"corresponding_institution_ids":["https://openalex.org/I4210124651"],"apc_list":null,"apc_paid":null,"fwci":1.0361,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.76485149,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"10"},"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.9970999956130981,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9965999722480774,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/streaming-algorithm","display_name":"Streaming algorithm","score":0.9238290786743164},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.8339598178863525},{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.7762011289596558},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6823699474334717},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6600315570831299},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.6152928471565247},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5965341329574585},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5614336729049683},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.43578287959098816},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4349581301212311},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.35136866569519043},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25476038455963135},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.2107948660850525},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13331818580627441}],"concepts":[{"id":"https://openalex.org/C187166803","wikidata":"https://www.wikidata.org/wiki/Q2835831","display_name":"Streaming algorithm","level":3,"score":0.9238290786743164},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.8339598178863525},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.7762011289596558},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6823699474334717},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6600315570831299},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.6152928471565247},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5965341329574585},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5614336729049683},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.43578287959098816},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4349581301212311},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35136866569519043},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25476038455963135},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.2107948660850525},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13331818580627441},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/dsaa54385.2022.10032383","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dsaa54385.2022.10032383","pdf_url":null,"source":{"id":"https://openalex.org/S4363608340","display_name":"2022 IEEE 9th International Conference on Data Science and Advanced Analytics (DSAA)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE 9th International Conference on Data Science and Advanced Analytics (DSAA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320309617","display_name":"National Foundation for Science and Technology Development","ror":"https://ror.org/04rw64z44"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W1680189815","https://openalex.org/W1989151913","https://openalex.org/W1997959284","https://openalex.org/W2033885045","https://openalex.org/W2061820396","https://openalex.org/W2101246692","https://openalex.org/W2108278206","https://openalex.org/W2131112624","https://openalex.org/W2158504911","https://openalex.org/W2160411082","https://openalex.org/W2491571354","https://openalex.org/W2545520746","https://openalex.org/W2608904808","https://openalex.org/W2752672873","https://openalex.org/W2755088640","https://openalex.org/W2950365512","https://openalex.org/W3128954550","https://openalex.org/W3136549045","https://openalex.org/W3171608239","https://openalex.org/W4211017427","https://openalex.org/W4223972941","https://openalex.org/W4246587691","https://openalex.org/W6679453101","https://openalex.org/W6686400581","https://openalex.org/W6744271739","https://openalex.org/W6751532856","https://openalex.org/W6753217642","https://openalex.org/W6763346186","https://openalex.org/W6773476673","https://openalex.org/W6779918837","https://openalex.org/W6779948498","https://openalex.org/W6783027836","https://openalex.org/W6796746553"],"related_works":["https://openalex.org/W2896347948","https://openalex.org/W2788127768","https://openalex.org/W2766474417","https://openalex.org/W2950500962","https://openalex.org/W2915041254","https://openalex.org/W2002467715","https://openalex.org/W4302557420","https://openalex.org/W2413963148","https://openalex.org/W1608444752","https://openalex.org/W2963443186"],"abstract_inverted_index":{"This":[0],"paper":[1],"proposes":[2],"two":[3],"fast":[4],"streaming":[5,55,68,140],"algorithms":[6,36,87,106,126,143],"for":[7],"the":[8,14,21,38,62,72,85,89,102,114,131,135,149],"problem":[9],"of":[10,17,91,104,113,134,151],"k-submodular":[11],"maximization":[12],"over":[13],"ground":[15],"set":[16],"n":[18],"elements":[19],"under":[20],"knapsack":[22],"constraint":[23],"which":[24],"is":[25,52,65],"important":[26],"and":[27,32,70,118,141],"popular":[28],"in":[29,130,145],"combinatorial":[30],"optimization":[31],"machine":[33],"learning.":[34],"Our":[35],"are":[37,81],"first":[39,50],"ones":[40],"that":[41,57,124],"provide":[42],"constant-approximation":[43],"ratios":[44,80],"within":[45],"O(nk)":[46],"query":[47],"complexity.":[48],"The":[49,121],"algorithm":[51,56,69],"a":[53,59,66,96],"single-pass":[54],"returns":[58],"1/10-approximation":[60],"solution,":[61],"second":[63],"one":[64],"multi-pass":[67],"improves":[71],"approximation":[73],"ratio":[74],"to":[75,84],"nearly":[76],"1/4.":[77],"Although":[78],"these":[79],"simply":[82],"near":[83],"state-of-the-art":[86],"yet":[88,144],"number":[90,150],"queries":[92],"can":[93],"diminish":[94],"by":[95,107],"large":[97],"factor.":[98],"We":[99],"further":[100],"investigate":[101],"performance":[103],"our":[105,125],"directing":[108],"several":[109],"experiments":[110],"on":[111],"instances":[112],"issue:":[115],"Influence":[116],"Maximization":[117],"Sensor":[119],"Placement.":[120],"outcomes":[122],"confirm":[123],"not":[127],"only":[128],"methodology":[129],"quality":[132],"arrangement":[133],"cutting":[136],"edge":[137],"techniques":[138],"including":[139],"non-streaming":[142],"addition":[146],"significantly":[147],"reduce":[148],"queries.":[152]},"counts_by_year":[{"year":2023,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}