{"id":"https://openalex.org/W2627898316","doi":"https://doi.org/10.1137/15m1053369","title":"Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds","display_name":"Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2627898316","doi":"https://doi.org/10.1137/15m1053369","mag":"2627898316"},"language":"en","primary_location":{"id":"doi:10.1137/15m1053369","is_oa":false,"landing_page_url":"https://doi.org/10.1137/15m1053369","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/A5069492649","display_name":"Matthias Poloczek","orcid":"https://orcid.org/0000-0003-4178-5521"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Matthias Poloczek","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025007932","display_name":"Georg Schnitger","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Georg Schnitger","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043667154","display_name":"David P. Williamson","orcid":"https://orcid.org/0000-0002-2884-0058"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"David P. Williamson","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5078740101","display_name":"Anke van Zuylen","orcid":"https://orcid.org/0000-0002-8182-3134"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Anke van Zuylen","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5069492649"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.6338,"has_fulltext":false,"cited_by_count":33,"citation_normalized_percentile":{"value":0.93991716,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"46","issue":"3","first_page":"1029","last_page":"1061"},"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.9987000226974487,"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.9965999722480774,"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/greedy-algorithm","display_name":"Greedy algorithm","score":0.7151143550872803},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6493942737579346},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.634636640548706},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6130675673484802},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5065411329269409},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5021719932556152},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.4814659655094147},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.45895323157310486},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4177687466144562},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3788091242313385}],"concepts":[{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.7151143550872803},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6493942737579346},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.634636640548706},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6130675673484802},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5065411329269409},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5021719932556152},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.4814659655094147},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.45895323157310486},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4177687466144562},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3788091242313385},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/15m1053369","is_oa":false,"landing_page_url":"https://doi.org/10.1137/15m1053369","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":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.5799999833106995}],"awards":[{"id":"https://openalex.org/G1047053060","display_name":null,"funder_award_id":"DFG SCHN 503/6-1","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G6262053590","display_name":null,"funder_award_id":"CCF-1115256","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320307517","display_name":"American Friends of the Alexander von Humboldt Foundation","ror":"https://ror.org/00c33a344"},{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1985123706","https://openalex.org/W1999032440","https://openalex.org/W2001564241","https://openalex.org/W2004660767","https://openalex.org/W2024650545","https://openalex.org/W2040924621","https://openalex.org/W2109039359","https://openalex.org/W2120954276","https://openalex.org/W2130407580","https://openalex.org/W2136026170","https://openalex.org/W2153838160","https://openalex.org/W2179494254","https://openalex.org/W2789043785","https://openalex.org/W2963010019","https://openalex.org/W3135922541","https://openalex.org/W3136693265","https://openalex.org/W4233413206"],"related_works":["https://openalex.org/W3110381201","https://openalex.org/W1531601525","https://openalex.org/W3204684126","https://openalex.org/W3117290964","https://openalex.org/W1594413663","https://openalex.org/W189401716","https://openalex.org/W2019216770","https://openalex.org/W2574250816","https://openalex.org/W2898570308","https://openalex.org/W2544904580"],"abstract_inverted_index":{"We":[0,173,201,263],"give":[1,250],"a":[2,16,39,43,65,74,81,135,149,251,272],"simple,":[3,252],"randomized":[4],"greedy":[5,61,99,115,180,219],"algorithm":[6,28,54,62,116,158,195,220,254,268],"for":[7],"the":[8,69,95,98,103,123,176,185,224,232,244,261,283,287],"maximum":[9],"satisfiability":[10],"problem":[11,82],"(MAX":[12],"SAT)":[13],"that":[14,59,155,182,191,216,255,265,294],"obtains":[15],"$\\frac{3}{4}$-approximation":[17,25],"in":[18,48,73,89,118,205,307],"expectation.":[19],"In":[20,91],"contrast":[21],"to":[22,42,93,231],"previously":[23],"known":[24],"algorithms,":[26],"our":[27,114,218,295],"does":[29],"not":[30],"use":[31,102],"flows":[32],"or":[33],"linear":[34,289,308],"programming.":[35],"Hence":[36],"we":[37,57,78,101,132,153,189,214,237,249,292],"provide":[38],"positive":[40],"answer":[41],"question":[44],"posed":[45,83],"by":[46,84,142],"Williamson":[47],"1998":[49],"on":[50],"whether":[51],"such":[52],"an":[53,119,228,257],"exists.":[55],"Moreover,":[56,291],"show":[58,154,190,215,264],"Johnson's":[60],"cannot":[63],"guarantee":[64],"$\\frac{3}{4}$-approximation,":[66],"even":[67],"if":[68,134,217],"variables":[70,124],"are":[71],"processed":[72],"random":[75,146],"order.":[76],"Thereby":[77],"partially":[79],"solve":[80],"Chen,":[85],"Friesen,":[86],"and":[87,111,299],"Zheng":[88],"1999.":[90],"order":[92],"explore":[94],"limitations":[96],"of":[97,105,108,129,178,227,275,286],"paradigm,":[100],"model":[104,152],"priority":[106,157,194],"algorithms":[107,181],"Borodin,":[109],"Nielsen,":[110],"Rackoff.":[112],"Since":[113],"works":[117],"online":[120],"scenario":[121],"where":[122,280],"arrive":[125],"with":[126,271],"their":[127],"set":[128],"undecided":[130],"clauses,":[131],"wonder":[133],"better":[136],"approximation":[137,198,246],"ratio":[138,199],"can":[139,159,196,210,238,304],"be":[140,211,305],"obtained":[141],"further":[143,174],"fine-tuning":[144],"its":[145,240],"decisions.":[147],"For":[148],"particular":[150],"information":[151],"no":[156,192],"approximate":[160],"Online":[161],"MAX":[162],"SAT":[163],"within":[164],"$\\frac{3}{4}":[165,278],"+":[166],"\\varepsilon$":[167],"(for":[168],"any":[169],"$\\varepsilon":[170],">":[171],"0$).":[172],"investigate":[175],"strength":[177],"deterministic":[179,253],"may":[183],"choose":[184],"variable":[186,225],"ordering.":[187],"Here":[188],"adaptive":[193],"achieve":[197],"$\\frac{3}{4}$.":[200],"propose":[202],"two":[203],"ways":[204],"which":[206],"this":[207,266],"inapproximability":[208],"result":[209],"bypassed.":[212],"First":[213],"is":[221,282,297],"additionally":[222],"given":[223],"assignments":[226],"optimal":[229],"solution":[230],"canonical":[233,288],"LP":[234],"relaxation,":[235],"then":[236],"derandomize":[239],"decisions":[241],"while":[242],"preserving":[243],"overall":[245],"guarantee.":[247],"Second":[248],"performs":[256],"additional":[258],"pass":[259,303],"over":[260],"input.":[262],"2-pass":[267],"satisfies":[269],"clauses":[270],"total":[273],"weight":[274],"at":[276],"least":[277],"{OPT}_{LP}$,":[279],"${OPT}_{LP}$":[281],"objective":[284],"value":[285],"program.":[290],"demonstrate":[293],"analysis":[296],"tight":[298],"detail":[300],"how":[301],"each":[302],"implemented":[306],"time.":[309]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}