{"id":"https://openalex.org/W7117985536","doi":"https://doi.org/10.1007/978-981-95-4839-2_25","title":"Modified Greedy Algorithm for\u00a0Monotone Submodular Maximization with\u00a0Knapsack and\u00a0Partition Matroid Constraints","display_name":"Modified Greedy Algorithm for\u00a0Monotone Submodular Maximization with\u00a0Knapsack and\u00a0Partition Matroid Constraints","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7117985536","doi":"https://doi.org/10.1007/978-981-95-4839-2_25"},"language":"en","primary_location":{"id":"doi:10.1007/978-981-95-4839-2_25","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-981-95-4839-2_25","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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":null,"display_name":"Dongkai Xu","orcid":"https://orcid.org/0009-0005-6690-8796"},"institutions":[{"id":"https://openalex.org/I139759216","display_name":"Beijing University of Posts and Telecommunications","ror":"https://ror.org/04w9fbh59","country_code":"CN","type":"education","lineage":["https://openalex.org/I139759216"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Dongkai Xu","raw_affiliation_strings":["Key Laboratory of Mathematics and Information Networks (Beijing University of Posts and Telecommunications), Ministry of Education, Beijing, 100876, China","School of Mathematical Sciences, Beijing University of Posts and Telecommunications, Beijing, 100876, China"],"raw_orcid":"https://orcid.org/0009-0005-6690-8796","affiliations":[{"raw_affiliation_string":"Key Laboratory of Mathematics and Information Networks (Beijing University of Posts and Telecommunications), Ministry of Education, Beijing, 100876, China","institution_ids":["https://openalex.org/I139759216"]},{"raw_affiliation_string":"School of Mathematical Sciences, Beijing University of Posts and Telecommunications, Beijing, 100876, China","institution_ids":["https://openalex.org/I139759216"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5121761683","display_name":"Jianhua Yuan","orcid":null},"institutions":[{"id":"https://openalex.org/I139759216","display_name":"Beijing University of Posts and Telecommunications","ror":"https://ror.org/04w9fbh59","country_code":"CN","type":"education","lineage":["https://openalex.org/I139759216"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jianhua Yuan","raw_affiliation_strings":["Key Laboratory of Mathematics and Information Networks (Beijing University of Posts and Telecommunications), Ministry of Education, Beijing, 100876, China","School of Mathematical Sciences, Beijing University of Posts and Telecommunications, Beijing, 100876, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Key Laboratory of Mathematics and Information Networks (Beijing University of Posts and Telecommunications), Ministry of Education, Beijing, 100876, China","institution_ids":["https://openalex.org/I139759216"]},{"raw_affiliation_string":"School of Mathematical Sciences, Beijing University of Posts and Telecommunications, Beijing, 100876, China","institution_ids":["https://openalex.org/I139759216"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005638239","display_name":"Zhongzheng Tang","orcid":"https://orcid.org/0000-0002-8593-0383"},"institutions":[{"id":"https://openalex.org/I139759216","display_name":"Beijing University of Posts and Telecommunications","ror":"https://ror.org/04w9fbh59","country_code":"CN","type":"education","lineage":["https://openalex.org/I139759216"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhongzheng Tang","raw_affiliation_strings":["Key Laboratory of Mathematics and Information Networks (Beijing University of Posts and Telecommunications), Ministry of Education, Beijing, 100876, China","School of Mathematical Sciences, Beijing University of Posts and Telecommunications, Beijing, 100876, China"],"raw_orcid":"https://orcid.org/0000-0002-8593-0383","affiliations":[{"raw_affiliation_string":"Key Laboratory of Mathematics and Information Networks (Beijing University of Posts and Telecommunications), Ministry of Education, Beijing, 100876, China","institution_ids":["https://openalex.org/I139759216"]},{"raw_affiliation_string":"School of Mathematical Sciences, Beijing University of Posts and Telecommunications, Beijing, 100876, China","institution_ids":["https://openalex.org/I139759216"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I139759216"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0565371,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"317","last_page":"329"},"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.8970000147819519,"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.8970000147819519,"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.02630000002682209,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.020099999383091927,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/matroid","display_name":"Matroid","score":0.8853999972343445},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.8429999947547913},{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.8428000211715698},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.738099992275238},{"id":"https://openalex.org/keywords/weighted-matroid","display_name":"Weighted matroid","score":0.6858000159263611},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6751000285148621},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.631600022315979},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.5799999833106995},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.5751000046730042}],"concepts":[{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.8853999972343445},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.8429999947547913},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.8428000211715698},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.738099992275238},{"id":"https://openalex.org/C124344645","wikidata":"https://www.wikidata.org/wiki/Q7979897","display_name":"Weighted matroid","level":5,"score":0.6858000159263611},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6751000285148621},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.631600022315979},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.5799999833106995},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.5751000046730042},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.546500027179718},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5292999744415283},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5063999891281128},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.45419999957084656},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44440001249313354},{"id":"https://openalex.org/C22425182","wikidata":"https://www.wikidata.org/wiki/Q6787906","display_name":"Matroid partitioning","level":4,"score":0.42879998683929443},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.42260000109672546},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3725999891757965},{"id":"https://openalex.org/C126221529","wikidata":"https://www.wikidata.org/wiki/Q3116070","display_name":"Greedy randomized adaptive search procedure","level":3,"score":0.3652999997138977},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.33869999647140503},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.3174999952316284},{"id":"https://openalex.org/C110484373","wikidata":"https://www.wikidata.org/wiki/Q264398","display_name":"Adjacency list","level":2,"score":0.2799000144004822},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.27619999647140503},{"id":"https://openalex.org/C178621168","wikidata":"https://www.wikidata.org/wiki/Q16155113","display_name":"Oriented matroid","level":4,"score":0.2745000123977661},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.26669999957084656},{"id":"https://openalex.org/C35995877","wikidata":"https://www.wikidata.org/wiki/Q1065968","display_name":"Partition problem","level":3,"score":0.25780001282691956},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.2563000023365021},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25429999828338623}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-981-95-4839-2_25","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-981-95-4839-2_25","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1680189815","https://openalex.org/W1998735557","https://openalex.org/W2033885045","https://openalex.org/W2053853578","https://openalex.org/W2080379754","https://openalex.org/W2092262344","https://openalex.org/W2098642746","https://openalex.org/W2110519532","https://openalex.org/W2143996311","https://openalex.org/W2145825677","https://openalex.org/W2757107770","https://openalex.org/W2964343703","https://openalex.org/W3041209271","https://openalex.org/W3048380211"],"related_works":[],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-05-05T08:41:31.759640","created_date":"2026-01-02T00:00:00"}