{"id":"https://openalex.org/W4223972941","doi":"https://doi.org/10.1007/s10878-022-00858-x","title":"Maximizing k-submodular functions under budget constraint: applications and streaming algorithms","display_name":"Maximizing k-submodular functions under budget constraint: applications and streaming algorithms","publication_year":2022,"publication_date":"2022-04-18","ids":{"openalex":"https://openalex.org/W4223972941","doi":"https://doi.org/10.1007/s10878-022-00858-x"},"language":"en","primary_location":{"id":"doi:10.1007/s10878-022-00858-x","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-022-00858-x","pdf_url":null,"source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-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":["ORlab, Faculty of Computer Science, Phenikaa University, Hanoi, 12116, Vietnam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ORlab, Faculty of Computer Science, Phenikaa University, Hanoi, 12116, Vietnam","institution_ids":["https://openalex.org/I4210124651"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5004520308","display_name":"Quang C. Vu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Quang C. Vu","raw_affiliation_strings":["Faculty of Information Security, People\u2019s Security Academy, Hanoi, 10000, Vietnam","Faculty of Information Security, People's Security Academy, Hanoi, 10000, Vietnam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Information Security, People\u2019s Security Academy, Hanoi, 10000, Vietnam","institution_ids":[]},{"raw_affiliation_string":"Faculty of Information Security, People's Security Academy, Hanoi, 10000, Vietnam","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063401160","display_name":"Dung K. T. Ha","orcid":null},"institutions":[{"id":"https://openalex.org/I177233841","display_name":"Vietnam National University, Hanoi","ror":"https://ror.org/02jmfj006","country_code":"VN","type":"education","lineage":["https://openalex.org/I177233841"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Dung K. T. Ha","raw_affiliation_strings":["Faculty of Information Technology, University of Engineering and Technology, Vietnam National University, Hanoi, 10000, Vietnam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Information Technology, University of Engineering and Technology, Vietnam National University, Hanoi, 10000, Vietnam","institution_ids":["https://openalex.org/I177233841"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045979733","display_name":"Tai Nguyen","orcid":null},"institutions":[{"id":"https://openalex.org/I177233841","display_name":"Vietnam National University, Hanoi","ror":"https://ror.org/02jmfj006","country_code":"VN","type":"education","lineage":["https://openalex.org/I177233841"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Tai T. Nguyen","raw_affiliation_strings":["Faculty of Information Technology, University of Engineering and Technology, Vietnam National University, Hanoi, 10000, Vietnam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Information Technology, University of Engineering and Technology, Vietnam National University, Hanoi, 10000, Vietnam","institution_ids":["https://openalex.org/I177233841"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025121706","display_name":"Nguyen D. Le","orcid":null},"institutions":[{"id":"https://openalex.org/I4210146698","display_name":"Hai Phong University of Management and Technology","ror":"https://ror.org/04gb9ay54","country_code":"VN","type":"education","lineage":["https://openalex.org/I4210146698"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Nguyen D. Le","raw_affiliation_strings":["Haiphong University, Haiphong, 180000, Vietnam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Haiphong University, Haiphong, 180000, Vietnam","institution_ids":["https://openalex.org/I4210146698"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5021107068"],"corresponding_institution_ids":["https://openalex.org/I4210124651"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":2.7414,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.91258626,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"44","issue":"1","first_page":"723","last_page":"751"},"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.9997000098228455,"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.9997000098228455,"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.9975000023841858,"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/T11182","display_name":"Auction Theory and Applications","score":0.9940999746322632,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.9425068497657776},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6590306758880615},{"id":"https://openalex.org/keywords/streaming-algorithm","display_name":"Streaming algorithm","score":0.5681954026222229},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.5665375590324402},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5486704111099243},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.52975994348526},{"id":"https://openalex.org/keywords/budget-constraint","display_name":"Budget constraint","score":0.5277731418609619},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.507422149181366},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4678799510002136},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.45800280570983887},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.45639416575431824},{"id":"https://openalex.org/keywords/element","display_name":"Element (criminal law)","score":0.45607948303222656},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4535433351993561},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4446573257446289},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4149567484855652},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.377159982919693},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3727729618549347},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.1588621735572815}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.9425068497657776},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6590306758880615},{"id":"https://openalex.org/C187166803","wikidata":"https://www.wikidata.org/wiki/Q2835831","display_name":"Streaming algorithm","level":3,"score":0.5681954026222229},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.5665375590324402},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5486704111099243},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.52975994348526},{"id":"https://openalex.org/C8505890","wikidata":"https://www.wikidata.org/wiki/Q605095","display_name":"Budget constraint","level":2,"score":0.5277731418609619},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.507422149181366},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4678799510002136},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.45800280570983887},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45639416575431824},{"id":"https://openalex.org/C200288055","wikidata":"https://www.wikidata.org/wiki/Q2621792","display_name":"Element (criminal law)","level":2,"score":0.45607948303222656},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4535433351993561},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4446573257446289},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4149567484855652},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.377159982919693},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3727729618549347},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.1588621735572815},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C133425853","wikidata":"https://www.wikidata.org/wiki/Q60571","display_name":"Neoclassical economics","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s10878-022-00858-x","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-022-00858-x","pdf_url":null,"source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:spr:jcomop:v:44:y:2022:i:1:d:10.1007_s10878-022-00858-x","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10878-022-00858-x","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W1680189815","https://openalex.org/W1989151913","https://openalex.org/W1997959284","https://openalex.org/W2033885045","https://openalex.org/W2053853578","https://openalex.org/W2061820396","https://openalex.org/W2101246692","https://openalex.org/W2108278206","https://openalex.org/W2118555456","https://openalex.org/W2132651631","https://openalex.org/W2138514146","https://openalex.org/W2160411082","https://openalex.org/W2179494254","https://openalex.org/W2491571354","https://openalex.org/W2545520746","https://openalex.org/W2611872949","https://openalex.org/W2752672873","https://openalex.org/W2950365512","https://openalex.org/W2962753204","https://openalex.org/W2982337331","https://openalex.org/W2988480584","https://openalex.org/W3008500873","https://openalex.org/W3099949921","https://openalex.org/W3128954550","https://openalex.org/W3136549045","https://openalex.org/W3171608239","https://openalex.org/W4231490457","https://openalex.org/W4246587691","https://openalex.org/W4292070111"],"related_works":["https://openalex.org/W2788127768","https://openalex.org/W1608444752","https://openalex.org/W2963443186","https://openalex.org/W2950365512","https://openalex.org/W3204684126","https://openalex.org/W4382197677","https://openalex.org/W2062310236","https://openalex.org/W3013568067","https://openalex.org/W4299354108","https://openalex.org/W3128830699"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":11},{"year":2022,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-05-17T08:19:37.847499","created_date":"2025-10-10T00:00:00"}