{"id":"https://openalex.org/W2179494254","doi":"https://doi.org/10.1137/130929205","title":"A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization","display_name":"A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W2179494254","doi":"https://doi.org/10.1137/130929205","mag":"2179494254"},"language":"en","primary_location":{"id":"doi:10.1137/130929205","is_oa":false,"landing_page_url":"https://doi.org/10.1137/130929205","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":true,"oa_status":"green","oa_url":"http://infoscience.epfl.ch/record/216224","any_repository_has_fulltext":true},"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":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","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":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5097149856","display_name":"Joseph Seffi","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Joseph Seffi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5068494085","display_name":"Roy Schwartz","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Roy Schwartz","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5002590915"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":21.4415,"has_fulltext":false,"cited_by_count":227,"citation_normalized_percentile":{"value":0.99629397,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":"44","issue":"5","first_page":"1384","last_page":"1402"},"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/T10237","display_name":"Cryptography and Data Security","score":0.9944000244140625,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9901999831199646,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.9713284373283386},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7176762819290161},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.6698467135429382},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6675234436988831},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5614937543869019},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.544636070728302},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4764271676540375},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.449705570936203},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4145231544971466},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2510126531124115},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.05264240503311157}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.9713284373283386},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7176762819290161},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.6698467135429382},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6675234436988831},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5614937543869019},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.544636070728302},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4764271676540375},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.449705570936203},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4145231544971466},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2510126531124115},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.05264240503311157},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","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":3,"locations":[{"id":"doi:10.1137/130929205","is_oa":false,"landing_page_url":"https://doi.org/10.1137/130929205","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"},{"id":"pmh:oai:infoscience.epfl.ch:216224","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/216224","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},{"id":"pmh:oai:infoscience.tind.io:216224","is_oa":true,"landing_page_url":"https://infoscience.epfl.ch/handle/20.500.14299/123710","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"research article"}],"best_oa_location":{"id":"pmh:oai:infoscience.epfl.ch:216224","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/216224","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W45588701","https://openalex.org/W1973315504","https://openalex.org/W1985123706","https://openalex.org/W1987550262","https://openalex.org/W1999032440","https://openalex.org/W2012329067","https://openalex.org/W2027680861","https://openalex.org/W2036948347","https://openalex.org/W2053381548","https://openalex.org/W2064933851","https://openalex.org/W2087038607","https://openalex.org/W2098341253","https://openalex.org/W2109974898","https://openalex.org/W2110373679","https://openalex.org/W2132651631","https://openalex.org/W2146489710","https://openalex.org/W4245581944"],"related_works":["https://openalex.org/W2896347948","https://openalex.org/W2402949237","https://openalex.org/W2766474417","https://openalex.org/W2950500962","https://openalex.org/W2915041254","https://openalex.org/W2964314169","https://openalex.org/W2594118609","https://openalex.org/W4302557420","https://openalex.org/W2413963148","https://openalex.org/W3204684126"],"abstract_inverted_index":{"We":[0,70],"consider":[1],"the":[2,20,35,87,111,120],"\\sf":[3,52,57,59,64],"Unconstrained":[4,53],"Submodular":[5,54],"Maximization":[6,55],"problem":[7],"in":[8],"which":[9,114],"we":[10],"are":[11],"given":[12],"a":[13,25,42,72,79],"nonnegative":[14],"submodular":[15,38],"function":[16],"$f:2^{\\mathcal{N}}\\rightarrow":[17],"\\mathbb{R}^+$,":[18],"and":[19,61,66,94],"objective":[21],"is":[22,32,105],"to":[23],"find":[24],"subset":[26],"$S\\subseteq":[27],"\\mathcal{N}$":[28],"maximizing":[29],"$f(S)$.":[30],"This":[31],"one":[33],"of":[34,45,63,83,91,110,119],"most":[36],"basic":[37],"optimization":[39],"problems,":[40],"having":[41],"wide":[43],"range":[44],"applications.":[46],"Some":[47],"well-known":[48],"problems":[49],"captured":[50],"by":[51],"include":[56],"Max-Cut,":[58],"Max-DiCut,":[60],"variants":[62],"Max-SAT":[65],"maximum":[67],"facility":[68],"location.":[69],"present":[71],"simple":[73],"randomized":[74],"linear":[75],"time":[76],"algorithm":[77,104],"achieving":[78],"tight":[80],"approximation":[81],"guarantee":[82],"1/2,":[84],"thus":[85],"matching":[86],"known":[88],"hardness":[89],"result":[90],"Feige,":[92],"Mirrokni,":[93],"Vondr\u00e1k":[95],"[SIAM":[96],"J.":[97],"Comput.,":[98],"40":[99],"(2011),":[100],"pp.":[101],"1133--1153].":[102],"Our":[103],"based":[106],"on":[107],"an":[108],"adaptation":[109],"greedy":[112],"approach":[113],"exploits":[115],"certain":[116],"symmetry":[117],"properties":[118],"problem.":[121]},"counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":17},{"year":2024,"cited_by_count":13},{"year":2023,"cited_by_count":16},{"year":2022,"cited_by_count":25},{"year":2021,"cited_by_count":30},{"year":2020,"cited_by_count":36},{"year":2019,"cited_by_count":24},{"year":2018,"cited_by_count":24},{"year":2017,"cited_by_count":24},{"year":2016,"cited_by_count":11},{"year":2014,"cited_by_count":3}],"updated_date":"2026-05-12T08:28:47.272897","created_date":"2025-10-10T00:00:00"}