{"id":"https://openalex.org/W4389374043","doi":"https://doi.org/10.1145/3628797.3628843","title":"Maximizing a $k$-Submodular Maximization Function under an Individual Knapsack Constraint","display_name":"Maximizing a $k$-Submodular Maximization Function under an Individual Knapsack Constraint","publication_year":2023,"publication_date":"2023-12-06","ids":{"openalex":"https://openalex.org/W4389374043","doi":"https://doi.org/10.1145/3628797.3628843"},"language":"en","primary_location":{"id":"doi:10.1145/3628797.3628843","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3628797.3628843","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 12th International Symposium on Information and Communication Technology","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/A5103160140","display_name":"Tan Tran","orcid":"https://orcid.org/0000-0001-5866-8458"},"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":"Tan Tran","raw_affiliation_strings":["University of Engineering and Technology, VNU, Viet Nam"],"affiliations":[{"raw_affiliation_string":"University of Engineering and Technology, VNU, Viet Nam","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 Pham","raw_affiliation_strings":["Phenikaa University, Viet Nam"],"affiliations":[{"raw_affiliation_string":"Phenikaa University, Viet Nam","institution_ids":["https://openalex.org/I4210124651"]}]},{"author_position":"last","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/I47265099","display_name":"Ho Chi Minh City University of Technology","ror":"https://ror.org/04qva2324","country_code":"VN","type":"education","lineage":["https://openalex.org/I123565023","https://openalex.org/I47265099"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Dung Ha","raw_affiliation_strings":["University of Engineering and Technology, Viet Nam"],"affiliations":[{"raw_affiliation_string":"University of Engineering and Technology, Viet Nam","institution_ids":["https://openalex.org/I47265099"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5103160140"],"corresponding_institution_ids":["https://openalex.org/I67868205"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.24228641,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"56","last_page":"62"},"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.9991000294685364,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9965000152587891,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.9384706020355225},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.8759410381317139},{"id":"https://openalex.org/keywords/automatic-summarization","display_name":"Automatic summarization","score":0.8311492204666138},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.6320337653160095},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.6082364320755005},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5600197911262512},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.548583984375},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5397840738296509},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.49394112825393677},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4637942910194397},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.4449363946914673},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.424976110458374},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.30378544330596924},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.20654484629631042},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.18679824471473694}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.9384706020355225},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.8759410381317139},{"id":"https://openalex.org/C170858558","wikidata":"https://www.wikidata.org/wiki/Q1394144","display_name":"Automatic summarization","level":2,"score":0.8311492204666138},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.6320337653160095},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.6082364320755005},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5600197911262512},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.548583984375},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5397840738296509},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.49394112825393677},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4637942910194397},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.4449363946914673},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.424976110458374},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30378544330596924},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.20654484629631042},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.18679824471473694},{"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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},{"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.1145/3628797.3628843","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3628797.3628843","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 12th International Symposium on Information and Communication Technology","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":15,"referenced_works":["https://openalex.org/W1608444752","https://openalex.org/W1680189815","https://openalex.org/W1989151913","https://openalex.org/W1997959284","https://openalex.org/W2061820396","https://openalex.org/W2064379477","https://openalex.org/W2101246692","https://openalex.org/W2491571354","https://openalex.org/W2752672873","https://openalex.org/W3128954550","https://openalex.org/W3136549045","https://openalex.org/W3171608239","https://openalex.org/W4223972941","https://openalex.org/W4246587691","https://openalex.org/W4319944861"],"related_works":["https://openalex.org/W2963844234","https://openalex.org/W2803250016","https://openalex.org/W4367393448","https://openalex.org/W2214256523","https://openalex.org/W3138989795","https://openalex.org/W3089449646","https://openalex.org/W2890692662","https://openalex.org/W1608444752","https://openalex.org/W2950365512","https://openalex.org/W3204684126"],"abstract_inverted_index":{"In":[0],"this":[1],"work,":[2],"we":[3,63],"consider":[4],"a":[5],"novel":[6],"problem":[7],"of":[8],"maximizing":[9],"monotone":[10],"k-submodular":[11],"functions":[12],"under":[13],"the":[14,20,98],"individual":[15],"knapsack":[16],"constraint":[17],"()":[18],"over":[19],"ground":[21],"set":[22],"V,":[23],"which":[24],"has":[25,45],"been":[26],"found":[27],"numerous":[28],"applications":[29],"in":[30],"machine":[31],"learning,":[32],"including":[33],"data":[34],"summarization":[35],"and":[36,48,78],"information":[37],"propagation.":[38],"We":[39],"propose":[40],"an":[41,57],"approximation":[42,46],"algorithm":[43,70,87],"that":[44,85],"ratio":[47],"takes":[49],"O(nklog":[50],"(n)/\u03f5)":[51],"query":[52],"complexity,":[53],"where":[54],"\u03f5":[55],"is":[56],"input":[58],"parameter.":[59],"Alongside":[60],"theoretical":[61],"analysis,":[62],"conduct":[64],"extensive":[65],"experiments":[66],"on":[67],"our":[68,86],"proposed":[69],"via":[71],"some":[72],"applications,":[73],"such":[74],"as":[75],"Influence":[76],"Maximization":[77],"Sensor":[79],"Placement.":[80],"The":[81],"experimental":[82],"results":[83],"demonstrate":[84],"gives":[88],"competitive":[89],"solution":[90],"quality":[91],"with":[92],"state-of-the-art":[93],"techniques":[94],"but":[95],"significantly":[96],"reduces":[97],"required":[99],"queries.":[100]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}