{"id":"https://openalex.org/W2922509654","doi":"https://doi.org/10.1201/9781351236423-42","title":"Submodular Functions Maximization Problems","display_name":"Submodular Functions Maximization Problems","publication_year":2018,"publication_date":"2018-05-15","ids":{"openalex":"https://openalex.org/W2922509654","doi":"https://doi.org/10.1201/9781351236423-42","mag":"2922509654"},"language":"en","primary_location":{"id":"doi:10.1201/9781351236423-42","is_oa":false,"landing_page_url":"https://doi.org/10.1201/9781351236423-42","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Handbook of Approximation Algorithms and Metaheuristics, Second Edition","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":"https://openalex.org/A5002590915","display_name":"Niv Buchbinder","orcid":"https://orcid.org/0000-0002-7014-8954"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Niv Buchbinder","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5077772086","display_name":"Moran Feldman","orcid":"https://orcid.org/0000-0002-1535-2979"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Moran Feldman","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5002590915"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.2722,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.97162107,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"753","last_page":"788"},"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.9997000098228455,"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.9997000098228455,"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.9884999990463257,"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/T10237","display_name":"Cryptography and Data Security","score":0.9758999943733215,"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/submodular-set-function","display_name":"Submodular set function","score":0.9452195167541504},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.6555657982826233},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.46986445784568787},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.400149941444397},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34517425298690796}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.9452195167541504},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.6555657982826233},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46986445784568787},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.400149941444397},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34517425298690796}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1201/9781351236423-42","is_oa":false,"landing_page_url":"https://doi.org/10.1201/9781351236423-42","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Handbook of Approximation Algorithms and Metaheuristics, Second Edition","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W123178497","https://openalex.org/W1498671329","https://openalex.org/W1526762477","https://openalex.org/W1601868537","https://openalex.org/W1680189815","https://openalex.org/W1757790940","https://openalex.org/W1767521945","https://openalex.org/W1955698431","https://openalex.org/W1961231572","https://openalex.org/W1997783781","https://openalex.org/W2027680861","https://openalex.org/W2038938388","https://openalex.org/W2053381548","https://openalex.org/W2059527251","https://openalex.org/W2094067695","https://openalex.org/W2103012681","https://openalex.org/W2126405569","https://openalex.org/W2132651631","https://openalex.org/W2149744080","https://openalex.org/W2158557760","https://openalex.org/W2164530213","https://openalex.org/W2252172643","https://openalex.org/W2263717697","https://openalex.org/W3207262409"],"related_works":["https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W1595919516","https://openalex.org/W2896347948","https://openalex.org/W2950500962","https://openalex.org/W2915041254","https://openalex.org/W4302557420","https://openalex.org/W2413963148","https://openalex.org/W2037938733","https://openalex.org/W2001839669"],"abstract_inverted_index":{"This":[0],"chapter":[1,29,59,106],"focuses":[2],"on":[3,76,122,133],"maximizing":[4,21,35],"a":[5,47,61,109,134],"special":[6],"class":[7],"of":[8,78,90,137],"functions":[9,12,23,37,80],"called":[10],"submodular":[11,22,36,55,66,79,116,128],"under":[13],"various":[14,40],"combinatorial":[15,26],"constraints.":[16,27,41],"It":[17,42,85],"deals":[18],"with":[19],"algorithms":[20,33,96],"subject":[24,38,45],"to":[25,39,46,81],"The":[28,58,105],"discusses":[30,52],"basic":[31,88,95],"discrete":[32,62],"for":[34,64,111,115,127],"explores":[43],"maximization":[44,56,117,129],"cardinality":[48],"constraint":[49],"and":[50,69,93],"also":[51,107],"the":[53,65,82,87,142],"unconstrained":[54],"problem.":[57],"presents":[60],"algorithm":[63],"welfare":[67],"problem":[68],"describes":[70,108],"continuous":[71,135],"methods":[72],"that":[73],"are":[74,131],"based":[75,121,132],"extensions":[77,92],"n-dimensional":[83],"cube.":[84],"explains":[86],"properties":[89],"these":[91,103,138],"analyses":[94],"obtaining":[97,112],"fractional":[98],"solutions":[99],"which":[100,119],"approximately":[101],"maximize":[102],"extensions.":[104],"method":[110],"inapproximability":[113],"results":[114,126],"problems":[118,130,139],"is":[120],"similar":[123],"techniques.":[124],"Many":[125],"relaxation":[136],"known":[140],"as":[141],"multilinear":[143],"relaxation.":[144]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}