{"id":"https://openalex.org/W4223893941","doi":"https://doi.org/10.1142/s0217595922500130","title":"Submodular Maximization Subject to a Knapsack Constraint Under Noise Models","display_name":"Submodular Maximization Subject to a Knapsack Constraint Under Noise Models","publication_year":2022,"publication_date":"2022-04-18","ids":{"openalex":"https://openalex.org/W4223893941","doi":"https://doi.org/10.1142/s0217595922500130"},"language":"en","primary_location":{"id":"doi:10.1142/s0217595922500130","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0217595922500130","pdf_url":null,"source":{"id":"https://openalex.org/S1254427","display_name":"Asia Pacific Journal of Operational Research","issn_l":"0217-5959","issn":["0217-5959","1793-7019"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Asia-Pacific Journal of Operational Research","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/A5073998124","display_name":"Dung T. K. Ha","orcid":"https://orcid.org/0000-0001-8375-7866"},"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 T. K. Ha","raw_affiliation_strings":["Faculty of Information Technology, University of Engineering and Technology, Vietnam National University, Hanoi, 144 Xuan Thuy Street, Cau Giay District, Hanoi 10000, Vietnam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Information Technology, University of Engineering and Technology, Vietnam National University, Hanoi, 144 Xuan Thuy Street, Cau Giay District, Hanoi 10000, Vietnam","institution_ids":["https://openalex.org/I177233841"]}]},{"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":true,"raw_author_name":"Canh V. Pham","raw_affiliation_strings":["ORLab, Faculty of Computer Science, Phenikaa University, Yen Nghia Ward, Ha Dong District, Hanoi, 12116, Vietnam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ORLab, Faculty of Computer Science, Phenikaa University, Yen Nghia Ward, Ha Dong District, Hanoi, 12116, Vietnam","institution_ids":["https://openalex.org/I4210124651"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5023647074","display_name":"Huan X. Hoang","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":"Huan X. Hoang","raw_affiliation_strings":["Faculty of Information Technology, University of Engineering and Technology, Vietnam National University, Hanoi, 144 Xuan Thuy Street, Cau Giay District, Hanoi 10000, Vietnam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Information Technology, University of Engineering and Technology, Vietnam National University, Hanoi, 144 Xuan Thuy Street, Cau Giay District, Hanoi 10000, Vietnam","institution_ids":["https://openalex.org/I177233841"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5021107068"],"corresponding_institution_ids":["https://openalex.org/I4210124651"],"apc_list":null,"apc_paid":null,"fwci":0.3044,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.5751004,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":"39","issue":"06","first_page":null,"last_page":null},"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.9976999759674072,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9957000017166138,"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.8950004577636719},{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.8637751936912537},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.7505436539649963},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.713661789894104},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.6263143420219421},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6196994185447693},{"id":"https://openalex.org/keywords/noise","display_name":"Noise (video)","score":0.46620973944664},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4622172713279724},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4515799283981323},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.16257521510124207}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.8950004577636719},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.8637751936912537},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.7505436539649963},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.713661789894104},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6263143420219421},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6196994185447693},{"id":"https://openalex.org/C99498987","wikidata":"https://www.wikidata.org/wiki/Q2210247","display_name":"Noise (video)","level":3,"score":0.46620973944664},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4622172713279724},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4515799283981323},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.16257521510124207},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"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":2,"locations":[{"id":"doi:10.1142/s0217595922500130","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0217595922500130","pdf_url":null,"source":{"id":"https://openalex.org/S1254427","display_name":"Asia Pacific Journal of Operational Research","issn_l":"0217-5959","issn":["0217-5959","1793-7019"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Asia-Pacific Journal of Operational Research","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:wsi:apjorx:v:39:y:2022:i:06:n:s0217595922500130","is_oa":false,"landing_page_url":"http://www.worldscientific.com/doi/abs/10.1142/S0217595922500130","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":18,"referenced_works":["https://openalex.org/W566586761","https://openalex.org/W1680189815","https://openalex.org/W2033885045","https://openalex.org/W2035165116","https://openalex.org/W2053853578","https://openalex.org/W2061820396","https://openalex.org/W2080379754","https://openalex.org/W2118555456","https://openalex.org/W2132651631","https://openalex.org/W2141403143","https://openalex.org/W2150256170","https://openalex.org/W2179494254","https://openalex.org/W2496738401","https://openalex.org/W2608904808","https://openalex.org/W2952019053","https://openalex.org/W2964131837","https://openalex.org/W4246587691","https://openalex.org/W4302772198"],"related_works":["https://openalex.org/W2357796514","https://openalex.org/W2393014972","https://openalex.org/W2357595179","https://openalex.org/W2896347948","https://openalex.org/W2351136238","https://openalex.org/W2402949237","https://openalex.org/W2891162720","https://openalex.org/W2950500962","https://openalex.org/W2915041254","https://openalex.org/W2964314169"],"abstract_inverted_index":{"The":[0],"field":[1],"of":[2,16,34,94,166,174],"Submodular":[3,63],"Maximization":[4,64,159],"subject":[5,65],"to":[6,13,54,66,122,170],"a":[7,14,67,80,111,142],"Knapsack":[8,68],"constraint":[9,69],"has":[10,76],"recently":[11],"expanded":[12],"variety":[15],"application":[17],"domains,":[18],"which":[19,97],"is":[20],"facing":[21],"some":[22,155],"challenges":[23],"such":[24],"as":[25],"data":[26,128,147],"explosions":[27],"or":[28],"additional":[29],"conditions.":[30],"There":[31],"exist":[32],"plenty":[33],"objective":[35],"functions":[36],"that":[37,139],"cannot":[38],"be":[39],"evaluated":[40],"exactly":[41],"in":[42,84],"many":[43],"real":[44],"cases":[45],"unless":[46],"they":[47],"are":[48,98,129],"estimated":[49],"with":[50,91,116],"errors.":[51],"It":[52],"leads":[53],"solving":[55],"the":[56,89,104,124,146,172,175],"problem":[57,90,160],"under":[58,70,114,161],"noise":[59,95],"models.":[60],"Somewhat":[61],"surprisingly,":[62],"Noise":[71],"models":[72,96],"([Formula:":[73],"see":[74,168],"text])":[75],"never":[77],"been":[78],"discussed":[79],"lot":[81],"before.":[82],"Hence,":[83],"this":[85],"paper,":[86],"we":[87,108,132,153],"consider":[88],"two":[92],"kinds":[93],"addition":[99],"and":[100,148],"multiplication.":[101],"Inspired":[102],"by":[103],"traditional":[105],"Greedy":[106,112],"algorithm,":[107],"first":[109],"propose":[110],"algorithm":[113,138],"Noises":[115],"provable":[117],"theoretical":[118,150],"bounds.":[119],"In":[120],"order":[121],"find":[123],"solution":[125],"when":[126],"input":[127],"extremely":[130],"large,":[131],"then":[133],"devise":[134],"an":[135,164],"efficient":[136],"streaming":[137],"scans":[140],"only":[141],"single":[143],"pass":[144],"over":[145],"guarantees":[149],"approximations.":[151],"Finally,":[152],"conduct":[154],"experiments":[156],"on":[157],"Influence":[158],"knapsack":[162],"constraint,":[163],"instance":[165],"[Formula:":[167],"text]":[169],"show":[171],"performances":[173],"proposed":[176],"algorithms.":[177]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}