{"id":"https://openalex.org/W4404633026","doi":"https://doi.org/10.1007/s10878-024-01232-9","title":"Enhanced deterministic approximation algorithm for non-monotone submodular maximization under knapsack constraint with linear query complexity","display_name":"Enhanced deterministic approximation algorithm for non-monotone submodular maximization under knapsack constraint with linear query complexity","publication_year":2024,"publication_date":"2024-11-22","ids":{"openalex":"https://openalex.org/W4404633026","doi":"https://doi.org/10.1007/s10878-024-01232-9"},"language":"en","primary_location":{"id":"doi:10.1007/s10878-024-01232-9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-024-01232-9","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, Vietnam"],"raw_orcid":"https://orcid.org/0000-0002-8118-1768","affiliations":[{"raw_affiliation_string":"ORLab, Faculty of Computer Science, Phenikaa University, Hanoi, Vietnam","institution_ids":["https://openalex.org/I4210124651"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"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":0.3457,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.65654808,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"49","issue":"1","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.9984999895095825,"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.9984999895095825,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9979000091552734,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.862350583076477},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.8058655261993408},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.7743853330612183},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.6364486217498779},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6048808693885803},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5659360885620117},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.4789896011352539},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.4740928113460541},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.46918535232543945},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4329596757888794},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43286436796188354},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.41540759801864624},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3907017111778259},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38796883821487427},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.37143251299858093},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3398359715938568}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.862350583076477},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.8058655261993408},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.7743853330612183},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.6364486217498779},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6048808693885803},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5659360885620117},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.4789896011352539},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.4740928113460541},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.46918535232543945},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4329596757888794},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43286436796188354},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.41540759801864624},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3907017111778259},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38796883821487427},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.37143251299858093},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3398359715938568},{"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.1007/s10878-024-01232-9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-024-01232-9","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:49:y:2025:i:1:d:10.1007_s10878-024-01232-9","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10878-024-01232-9","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":16,"referenced_works":["https://openalex.org/W1503396090","https://openalex.org/W2033885045","https://openalex.org/W2045492898","https://openalex.org/W2053853578","https://openalex.org/W2064933851","https://openalex.org/W2094067695","https://openalex.org/W2109309418","https://openalex.org/W2141403143","https://openalex.org/W2579645839","https://openalex.org/W3165629504","https://openalex.org/W3200286961","https://openalex.org/W4231490457","https://openalex.org/W4385562547","https://openalex.org/W4385767906","https://openalex.org/W4387497867","https://openalex.org/W4388968519"],"related_works":["https://openalex.org/W2393014972","https://openalex.org/W2357796514","https://openalex.org/W2357595179","https://openalex.org/W2351136238","https://openalex.org/W2169800510","https://openalex.org/W3171554204","https://openalex.org/W3204684126","https://openalex.org/W3199776955","https://openalex.org/W3112089036","https://openalex.org/W2167807475"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}