{"id":"https://openalex.org/W2094067695","doi":"https://doi.org/10.1137/110839655","title":"Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes","display_name":"Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W2094067695","doi":"https://doi.org/10.1137/110839655","mag":"2094067695"},"language":"en","primary_location":{"id":"doi:10.1137/110839655","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110839655","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5036503505","display_name":"Chandra Chekuri","orcid":"https://orcid.org/0000-0003-3035-1699"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Chandra Chekuri","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003968234","display_name":"J. Vondr\u00e1k","orcid":"https://orcid.org/0000-0002-4674-0771"},"institutions":[{"id":"https://openalex.org/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jan Vondr\u00e1k","raw_affiliation_strings":["IBM, ,"],"affiliations":[{"raw_affiliation_string":"IBM, ,","institution_ids":["https://openalex.org/I1341412227"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033406324","display_name":"Rico Zenklusen","orcid":"https://orcid.org/0000-0002-7148-9304"},"institutions":[{"id":"https://openalex.org/I145311948","display_name":"Johns Hopkins University","ror":"https://ror.org/00za53h95","country_code":"US","type":"education","lineage":["https://openalex.org/I145311948"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rico Zenklusen","raw_affiliation_strings":["Johns Hopkins University","Swiss Federal Institute of Technology Zurich"],"affiliations":[{"raw_affiliation_string":"Johns Hopkins University","institution_ids":["https://openalex.org/I145311948"]},{"raw_affiliation_string":"Swiss Federal Institute of Technology Zurich","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5036503505"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":17.5476,"has_fulltext":false,"cited_by_count":236,"citation_normalized_percentile":{"value":0.99497703,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":100},"biblio":{"volume":"43","issue":"6","first_page":"1831","last_page":"1879"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9970999956130981,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.994700014591217,"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/polytope","display_name":"Polytope","score":0.7630358934402466},{"id":"https://openalex.org/keywords/multilinear-map","display_name":"Multilinear map","score":0.7205827832221985},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.703238308429718},{"id":"https://openalex.org/keywords/matroid","display_name":"Matroid","score":0.7016004323959351},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6897718906402588},{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.6424988508224487},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5748955011367798},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.4619365930557251},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.45574191212654114},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4513612389564514},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.41123050451278687},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.3580544590950012},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.35187071561813354},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.0847335159778595}],"concepts":[{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.7630358934402466},{"id":"https://openalex.org/C84392682","wikidata":"https://www.wikidata.org/wiki/Q1952404","display_name":"Multilinear map","level":2,"score":0.7205827832221985},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.703238308429718},{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.7016004323959351},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6897718906402588},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.6424988508224487},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5748955011367798},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.4619365930557251},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.45574191212654114},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4513612389564514},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41123050451278687},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3580544590950012},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35187071561813354},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0847335159778595},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/110839655","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110839655","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W39861960","https://openalex.org/W782508147","https://openalex.org/W1680189815","https://openalex.org/W1973315504","https://openalex.org/W1981351071","https://openalex.org/W1996971123","https://openalex.org/W1997783781","https://openalex.org/W1998785385","https://openalex.org/W2005509629","https://openalex.org/W2019062750","https://openalex.org/W2024427769","https://openalex.org/W2033885045","https://openalex.org/W2038938388","https://openalex.org/W2053381548","https://openalex.org/W2055037276","https://openalex.org/W2064933851","https://openalex.org/W2072291569","https://openalex.org/W2077735330","https://openalex.org/W2081254453","https://openalex.org/W2104685111","https://openalex.org/W2109309418","https://openalex.org/W2113437680","https://openalex.org/W2122109562","https://openalex.org/W2132651631","https://openalex.org/W2143996311","https://openalex.org/W2170344325","https://openalex.org/W2757107770","https://openalex.org/W4238717878"],"related_works":["https://openalex.org/W241127407","https://openalex.org/W2381035939","https://openalex.org/W1521824362","https://openalex.org/W2468477307","https://openalex.org/W2910645127","https://openalex.org/W4385627918","https://openalex.org/W4252399622","https://openalex.org/W4320232260","https://openalex.org/W1499990180","https://openalex.org/W4241672388"],"abstract_inverted_index":{"We":[0,107,264],"consider":[1],"the":[2,70,82,88,152,156,203,225,233,244],"problem":[3],"of":[4,24,51,74,158,162,205,228,232],"maximizing":[5,69,255],"a":[6,16,22,41,49,60,77,124,145,159,166,182,215,220,250],"nonnegative":[7],"submodular":[8,258],"set":[9,18],"function":[10],"$f:2^N":[11],"\\rightarrow":[12],"{\\mathbb":[13],"R}_+$":[14],"over":[15,76,123],"ground":[17],"$N$":[19],"subject":[20,260],"to":[21,47,120,180,201,224,237,261],"variety":[23],"packing-type":[25],"constraints":[26,164],"including":[27],"(multiple)":[28],"matroid":[29,167,245],"constraints,":[30,32,83],"knapsack":[31,163],"and":[33,84,257],"their":[34],"intersections.":[35],"In":[36,190],"this":[37,92,135],"paper":[38],"we":[39,114,170,212],"develop":[40],"general":[42],"framework":[43,253],"that":[44,80,172,214],"allows":[45],"us":[46],"derive":[48],"number":[50,161],"new":[52],"results,":[53],"in":[54,103],"particular,":[55,191],"when":[56,151,186],"$f$":[57,75,187],"may":[58,272],"be":[59,199],"nonmonotone":[61,143],"function.":[62],"Our":[63,247],"algorithms":[64,119],"are":[65,176],"based":[66],"on":[67],"(approximately)":[68],"multilinear":[71],"extension":[72],"$F$":[73,122],"polytope":[78,126,153],"$P$":[79,127],"represents":[81],"then":[85],"effectively":[86],"rounding":[87],"fractional":[89,183],"solution.":[90],"Although":[91],"approach":[93],"has":[94,100],"been":[95,101],"used":[96],"quite":[97],"successfully,":[98],"it":[99],"limited":[102],"some":[104],"important":[105],"ways.":[106],"overcome":[108],"these":[109],"limitations":[110],"as":[111],"follows.":[112],"First,":[113],"give":[115,265],"constant":[116,146],"factor":[117,147],"approximation":[118],"maximize":[121],"downward-closed":[125],"described":[128],"by":[129],"an":[130,177,238],"efficient":[131],"separation":[132],"oracle.":[133],"Previously":[134],"was":[136,148,154],"known":[137,149],"only":[138,150],"for":[139,195,219,243,254],"monotone":[140],"functions.":[141],"For":[142],"functions,":[144],"either":[155],"intersection":[157,204],"fixed":[160],"or":[165],"polytope.":[168,246],"Second,":[169],"show":[171,213],"contention":[173,192,216,240],"resolution":[174,193,217,241,270],"schemes":[175,194,271],"effective":[178],"way":[179],"round":[181],"solution,":[184],"even":[185],"is":[188,222],"nonmonotone.":[189],"different":[196,206],"polytopes":[197],"can":[198],"combined":[200],"handle":[202],"constraints.":[207,263],"Via":[208],"linear":[209,256],"programming":[210],"duality":[211],"scheme":[218,242],"constraint":[221],"related":[223],"correlation":[226],"gap":[227],"weighted":[229],"rank":[230],"functions":[231,259],"constraint.":[234],"This":[235],"leads":[236],"optimal":[239],"results":[248],"provide":[249],"broadly":[251],"applicable":[252],"independence":[262],"several":[266],"illustrative":[267],"examples.":[268],"Contention":[269],"find":[273],"other":[274],"applications.":[275]},"counts_by_year":[{"year":2025,"cited_by_count":16},{"year":2024,"cited_by_count":13},{"year":2023,"cited_by_count":14},{"year":2022,"cited_by_count":19},{"year":2021,"cited_by_count":32},{"year":2020,"cited_by_count":26},{"year":2019,"cited_by_count":42},{"year":2018,"cited_by_count":22},{"year":2017,"cited_by_count":18},{"year":2016,"cited_by_count":12},{"year":2015,"cited_by_count":11},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":4}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}