{"id":"https://openalex.org/W7135199030","doi":"https://doi.org/10.48550/arxiv.2603.11996","title":"Deterministic Algorithm for Non-monotone Submodular Maximization under Matroid and Knapsack Constraints","display_name":"Deterministic Algorithm for Non-monotone Submodular Maximization under Matroid and Knapsack Constraints","publication_year":2026,"publication_date":"2026-03-12","ids":{"openalex":"https://openalex.org/W7135199030","doi":"https://doi.org/10.48550/arxiv.2603.11996"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.11996","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.11996","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2603.11996","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5061623855","display_name":"Shengminjie Chen","orcid":"https://orcid.org/0000-0001-9486-0674"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Chen, Shengminjie","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5129082091","display_name":"Yiwei Gao","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gao, Yiwei","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5129056181","display_name":"Kaifeng Lin","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lin, Kaifeng","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5128999785","display_name":"Xiaoming Sun","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sun, Xiaoming","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5129044188","display_name":"Jialin Zhang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhang, Jialin","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5061623855"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"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.9671000242233276,"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.9671000242233276,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.01080000028014183,"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.00559999980032444,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.9362999796867371},{"id":"https://openalex.org/keywords/matroid","display_name":"Matroid","score":0.9351999759674072},{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.9229000210762024},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6503000259399414},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5691999793052673},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.5135999917984009},{"id":"https://openalex.org/keywords/weighted-matroid","display_name":"Weighted matroid","score":0.4902999997138977},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.4823000133037567}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9362999796867371},{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.9351999759674072},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.9229000210762024},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6503000259399414},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6230000257492065},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5691999793052673},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.5135999917984009},{"id":"https://openalex.org/C124344645","wikidata":"https://www.wikidata.org/wiki/Q7979897","display_name":"Weighted matroid","level":5,"score":0.4902999997138977},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.4823000133037567},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.4652000069618225},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4584999978542328},{"id":"https://openalex.org/C22425182","wikidata":"https://www.wikidata.org/wiki/Q6787906","display_name":"Matroid partitioning","level":4,"score":0.4424999952316284},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.4336000084877014},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4018000066280365},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3946000039577484},{"id":"https://openalex.org/C178621168","wikidata":"https://www.wikidata.org/wiki/Q16155113","display_name":"Oriented matroid","level":4,"score":0.382099986076355},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.37130001187324524},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.37059998512268066},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3612000048160553},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.28519999980926514},{"id":"https://openalex.org/C84392682","wikidata":"https://www.wikidata.org/wiki/Q1952404","display_name":"Multilinear map","level":2,"score":0.28349998593330383},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.28139999508857727},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2709999978542328},{"id":"https://openalex.org/C109275537","wikidata":"https://www.wikidata.org/wiki/Q1154420","display_name":"Subset sum problem","level":3,"score":0.26840001344680786}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.11996","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.11996","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2603.11996","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.11996","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Submodular":[0],"maximization":[1],"constitutes":[2],"a":[3],"prominent":[4],"research":[5],"topic":[6],"in":[7,26,73,109],"combinatorial":[8],"optimization":[9],"and":[10,58,122,137],"theoretical":[11],"computer":[12],"science,":[13],"with":[14],"extensive":[15],"applications":[16],"across":[17],"diverse":[18],"domains.":[19],"While":[20],"substantial":[21],"advancements":[22],"have":[23],"been":[24],"achieved":[25],"approximation":[27,38,48,86,101,128],"algorithms":[28,35,49,71,107],"for":[29,50,93,134,139],"submodular":[30,53],"maximization,":[31],"the":[32,62,96,116,119,125],"majority":[33],"of":[34,88,103,118,130],"yielding":[36],"high":[37],"guarantees":[39],"are":[40],"randomized.":[41],"In":[42],"this":[43],"work,":[44],"we":[45,67],"investigate":[46],"deterministic":[47,70,127],"maximizing":[51],"non-monotone":[52],"functions":[54],"subject":[55],"to":[56],"matroid":[57,80,135],"knapsack":[59,94,140],"constraints.":[60,141],"For":[61],"two":[63],"distinct":[64],"constraint":[65],"settings,":[66],"propose":[68],"novel":[69],"grounded":[72],"an":[74,85,100],"extended":[75],"multilinear":[76],"extension":[77],"framework.":[78],"Under":[79],"constraints,":[81,95],"our":[82],"algorithm":[83,98],"achieves":[84],"ratio":[87,102],"$(0.385":[89],"-":[90,132],"\u03b5)$,":[91],"whereas":[92],"proposed":[97],"attains":[99],"$(0.367":[104,131],"-\u03b5)$.":[105],"Both":[106],"run":[108],"$\\mathrm{poly}(n)$":[110],"query":[111],"complexity,":[112],"where":[113],"$n$":[114],"is":[115],"size":[117],"ground":[120],"set,":[121],"improve":[123],"upon":[124],"state-of-the-art":[126],"ratios":[129],"\u03b5)$":[133],"constraints":[136],"$0.25$":[138]},"counts_by_year":[],"updated_date":"2026-03-14T06:46:50.379900","created_date":"2026-03-14T00:00:00"}