{"id":"https://openalex.org/W2038938388","doi":"https://doi.org/10.1137/110832318","title":"Symmetry and Approximability of Submodular Maximization Problems","display_name":"Symmetry and Approximability of Submodular Maximization Problems","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W2038938388","doi":"https://doi.org/10.1137/110832318","mag":"2038938388"},"language":"en","primary_location":{"id":"doi:10.1137/110832318","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110832318","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/A5003968234","display_name":"J. Vondr\u00e1k","orcid":"https://orcid.org/0000-0002-4674-0771"},"institutions":[{"id":"https://openalex.org/I4210085935","display_name":"IBM Research - Almaden","ror":"https://ror.org/005w8dd04","country_code":"US","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210085935","https://openalex.org/I4210114115"]},{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jan Vondr\u00e1k","raw_affiliation_strings":["Princeton University","IBM Almaden Research Center, San Jose, CA 95120"],"affiliations":[{"raw_affiliation_string":"Princeton University","institution_ids":["https://openalex.org/I20089843"]},{"raw_affiliation_string":"IBM Almaden Research Center, San Jose, CA 95120","institution_ids":["https://openalex.org/I4210085935"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5003968234"],"corresponding_institution_ids":["https://openalex.org/I20089843","https://openalex.org/I4210085935"],"apc_list":null,"apc_paid":null,"fwci":15.1639,"has_fulltext":false,"cited_by_count":117,"citation_normalized_percentile":{"value":0.99335611,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":"42","issue":"1","first_page":"265","last_page":"304"},"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.9998999834060669,"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.9998999834060669,"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/T12288","display_name":"Optimization and Search Problems","score":0.9943000078201294,"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"}},{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9937000274658203,"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.9147679209709167},{"id":"https://openalex.org/keywords/matroid","display_name":"Matroid","score":0.753014087677002},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6825780868530273},{"id":"https://openalex.org/keywords/multilinear-map","display_name":"Multilinear map","score":0.6676639914512634},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6274078488349915},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5240122079849243},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48483574390411377},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.4339882731437683},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.4291289150714874},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.42281368374824524},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2433975338935852},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.1587313711643219},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1583455502986908}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.9147679209709167},{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.753014087677002},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6825780868530273},{"id":"https://openalex.org/C84392682","wikidata":"https://www.wikidata.org/wiki/Q1952404","display_name":"Multilinear map","level":2,"score":0.6676639914512634},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6274078488349915},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5240122079849243},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48483574390411377},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.4339882731437683},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.4291289150714874},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.42281368374824524},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2433975338935852},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.1587313711643219},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1583455502986908},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/110832318","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110832318","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1680189815","https://openalex.org/W1991528957","https://openalex.org/W1997783781","https://openalex.org/W2029828838","https://openalex.org/W2035575256","https://openalex.org/W2053381548","https://openalex.org/W2053853578","https://openalex.org/W2072291569","https://openalex.org/W2113437680","https://openalex.org/W2128059732","https://openalex.org/W2132651631","https://openalex.org/W2143996311","https://openalex.org/W2757107770","https://openalex.org/W4238439820"],"related_works":["https://openalex.org/W4252399622","https://openalex.org/W4320232260","https://openalex.org/W1499990180","https://openalex.org/W4241672388","https://openalex.org/W2950365512","https://openalex.org/W1608444752","https://openalex.org/W3204684126","https://openalex.org/W2062310236","https://openalex.org/W3013568067","https://openalex.org/W2512208967"],"abstract_inverted_index":{"A":[0,162],"number":[1,213,272],"of":[2,14,18,64,92,122,135,150,159,192,207,209,254,288,304,313],"recent":[3],"results":[4,22,54,115],"on":[5,61],"optimization":[6],"problems":[7],"involving":[8],"submodular":[9,117,126,140,154,249,291],"functions":[10],"have":[11],"made":[12],"use":[13],"the":[15,19,26,31,56,62,101,120,133,148,157,172,181,195,252,259,300],"multilinear":[16,84],"relaxation":[17],"problem.":[20],"These":[21],"hold":[23],"typically":[24],"in":[25,55,82,194],"value":[27,57,235],"oracle":[28,58,108],"model,":[29,59],"where":[30,276],"objective":[32],"function":[33,155,250,292],"is":[34,70,87,187,204,240],"accessible":[35],"via":[36],"a":[37,43,48,78,88,96,129,143,152,160,205,222,247,255,264,289,295,311],"black":[38],"box":[39],"returning":[40],"$f(S)$":[41],"for":[42,72,94,116,124,137,167,198,228,245,286,317],"given":[44],"$S$.":[45],"We":[46,178,280],"present":[47,263,282],"general":[49,256],"approach":[50],"to":[51,190,294],"deriving":[52],"inapproximability":[53],"based":[60],"notion":[63],"symmetry":[65,80,102],"gap.":[66],"Our":[67],"main":[68],"result":[69],"that":[71,76,171,180,218],"any":[73,199,219,318],"fixed":[74,319],"instance":[75],"exhibits":[77],"certain":[79],"gap":[81,103],"its":[83],"relaxation,":[85],"there":[86,203,239],"naturally":[89],"related":[90,189],"class":[91,206,230],"instances":[93],"which":[95],"better":[97,223],"approximation":[98,183,244],"factor":[99,243,303],"than":[100,224],"would":[104,231],"require":[105,232],"exponentially":[106,233],"many":[107,234],"queries.":[109,236],"This":[110],"unifies":[111],"several":[112],"known":[113,302],"hardness":[114,312],"maximization,":[118],"e.g.,":[119],"optimality":[121],"$(1-1/e)$-approximation":[123],"monotone":[125],"maximization":[127,287],"under":[128],"cardinality":[130],"constraint":[131],"and":[132],"impossibility":[134],"$(\\frac12+\\epsilon)$-approximation":[136],"unconstrained":[138],"(nonmonotone)":[139],"maximization.":[141],"As":[142],"new":[144],"application,":[145],"we":[146,262,309],"consider":[147],"problem":[149],"maximizing":[151,246],"nonmonotone":[153,248,290],"over":[156,251],"bases":[158,193,253],"matroid.":[161,196,257],"$(\\frac16-o(1))$-approximation":[163],"has":[164],"been":[165],"developed":[166],"this":[168,229,307],"problem,":[169,308],"assuming":[170,268],"matroid":[173,296],"contains":[174],"two":[175],"disjoint":[176],"bases.":[177],"show":[179],"best":[182],"one":[184],"can":[185],"achieve":[186],"indeed":[188],"packings":[191],"Specifically,":[197],"$k":[200],"\\geq":[201],"2$,":[202],"matroids":[208],"fractional":[210,269],"base":[211,270],"packing":[212,271],"$\\nu":[214,277],"=":[215,226],"\\frac{k}{k-1}$":[216],"such":[217],"algorithm":[220,267],"achieving":[221],"$(1-\\frac{1}{\\nu})":[225],"\\frac{1}{k}$-approximation":[227],"In":[237],"particular,":[238],"no":[241],"constant":[242],"On":[258],"positive":[260],"side,":[261],"$\\frac12":[265],"(1-\\frac{1}{\\nu}-o(1))$-approximation":[266],"at":[273],"least":[274],"$\\nu$,":[275],"\\in":[278],"(1,2]$.":[279],"also":[281],"an":[283],"improved":[284],"$0.309$-approximation":[285],"subject":[293],"independence":[297],"constraint,":[298],"improving":[299],"previously":[301],"$\\frac14-\\epsilon$.":[305],"For":[306],"obtain":[310],"$(\\frac12":[314],"+":[315],"\\epsilon)$-approximation":[316],"$\\epsilon>0$.":[320]},"counts_by_year":[{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":8},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":15},{"year":2019,"cited_by_count":10},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":11},{"year":2016,"cited_by_count":13},{"year":2015,"cited_by_count":12},{"year":2014,"cited_by_count":12},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":4}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}