{"id":"https://openalex.org/W2125674105","doi":"https://doi.org/10.1137/s0097539703434620","title":"An Extension of the Lov\u00e1sz Local Lemma, and its Applications to Integer Programming","display_name":"An Extension of the Lov\u00e1sz Local Lemma, and its Applications to Integer Programming","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W2125674105","doi":"https://doi.org/10.1137/s0097539703434620","mag":"2125674105"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539703434620","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539703434620","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/A5005118312","display_name":"Aravind Srinivasan","orcid":"https://orcid.org/0000-0002-0062-3684"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Aravind Srinivasan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5005118312"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.9982,"has_fulltext":false,"cited_by_count":25,"citation_normalized_percentile":{"value":0.77642716,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"36","issue":"3","first_page":"609","last_page":"634"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9983999729156494,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.998199999332428,"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/mathematics","display_name":"Mathematics","score":0.7536154389381409},{"id":"https://openalex.org/keywords/lemma","display_name":"Lemma (botany)","score":0.6212649345397949},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.6040388345718384},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.57279372215271},{"id":"https://openalex.org/keywords/randomized-rounding","display_name":"Randomized rounding","score":0.5655539035797119},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5498292446136475},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5418992042541504},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5024709701538086},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.47640764713287354},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.4715585708618164},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.4447482228279114},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.4383101463317871},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.4367135465145111},{"id":"https://openalex.org/keywords/complement","display_name":"Complement (music)","score":0.4191229045391083},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.2631767988204956},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.19462594389915466},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.11684823036193848}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7536154389381409},{"id":"https://openalex.org/C2777759810","wikidata":"https://www.wikidata.org/wiki/Q149316","display_name":"Lemma (botany)","level":3,"score":0.6212649345397949},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.6040388345718384},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.57279372215271},{"id":"https://openalex.org/C32029473","wikidata":"https://www.wikidata.org/wiki/Q7292010","display_name":"Randomized rounding","level":3,"score":0.5655539035797119},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5498292446136475},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5418992042541504},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5024709701538086},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.47640764713287354},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.4715585708618164},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.4447482228279114},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.4383101463317871},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.4367135465145111},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.4191229045391083},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2631767988204956},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19462594389915466},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.11684823036193848},{"id":"https://openalex.org/C46757340","wikidata":"https://www.wikidata.org/wiki/Q43238","display_name":"Poaceae","level":2,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C188082640","wikidata":"https://www.wikidata.org/wiki/Q1780899","display_name":"Complementation","level":4,"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C127716648","wikidata":"https://www.wikidata.org/wiki/Q104053","display_name":"Phenotype","level":3,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539703434620","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539703434620","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":25,"referenced_works":["https://openalex.org/W1964089073","https://openalex.org/W1993119087","https://openalex.org/W2001911901","https://openalex.org/W2002658910","https://openalex.org/W2018716367","https://openalex.org/W2022191808","https://openalex.org/W2022392080","https://openalex.org/W2057128446","https://openalex.org/W2059570262","https://openalex.org/W2063844956","https://openalex.org/W2064779029","https://openalex.org/W2073127061","https://openalex.org/W2100061495","https://openalex.org/W2128452148","https://openalex.org/W2130956934","https://openalex.org/W2134422938","https://openalex.org/W2140322654","https://openalex.org/W2146017177","https://openalex.org/W2152453230","https://openalex.org/W2157054705","https://openalex.org/W2158219072","https://openalex.org/W2163322487","https://openalex.org/W2400180097","https://openalex.org/W2611754984","https://openalex.org/W3011766368"],"related_works":["https://openalex.org/W2268207117","https://openalex.org/W1916943706","https://openalex.org/W3100114454","https://openalex.org/W2561769964","https://openalex.org/W2002272911","https://openalex.org/W2507810539","https://openalex.org/W2035016254","https://openalex.org/W2950751115","https://openalex.org/W2031277014","https://openalex.org/W168026201"],"abstract_inverted_index":{"The":[0],"Lov\u00e1sz":[1,8],"local":[2,120],"lemma":[3,121],"due":[4,175],"to":[5,46,49,106,122,176,186],"Erdo\u02dds":[6],"and":[7,10,83,99],"(Infinite":[9],"Finite":[11],"Sets,":[12],"Colloq.":[13],"Math.":[14],"Soc.":[15],"J.":[16],"Bolyai":[17],"11,":[18],"1975,":[19],"pp.":[20,104,184],"609\u2013627)":[21],"is":[22,51],"a":[23,52,62],"powerful":[24],"tool":[25],"in":[26],"proving":[27],"the":[28,44,119,139,170],"existence":[29],"of":[30,37,54,58,78,92,118,142,172,191],"rare":[31],"events.":[32],"We":[33,114,167],"present":[34],"an":[35],"extension":[36,117],"this":[38],"lemma,":[39],"which":[40,59],"works":[41],"well":[42],"when":[43],"event":[45],"be":[47],"shown":[48],"exist":[50],"conjunction":[53],"individual":[55],"events,":[56],"each":[57],"asserts":[60],"that":[61,124],"random":[63],"variable":[64],"does":[65],"not":[66],"deviate":[67],"much":[68,131],"from":[69,164],"its":[70],"mean.":[71],"As":[72],"applications,":[73],"we":[74],"consider":[75],"two":[76],"classes":[77],"NP\u2010hard":[79],"integer":[80,85,144,196],"programs:":[81],"minimax":[82],"covering":[84,195],"programs.":[86,197],"A":[87],"key":[88],"technique,":[89],"randomized":[90,125],"rounding":[91,126],"linear":[93],"relaxations,":[94],"was":[95],"developed":[96],"by":[97],"Raghavan":[98,177],"Thompson":[100],"(Combinatorica,":[101],"7":[102],"(1987),":[103],"365\u2013374)":[105],"derive":[107],"good":[108],"approximation":[109],"algorithms":[110],"for":[111,194],"such":[112],"problems.":[113],"use":[115],"our":[116,192],"prove":[123],"produces,":[127],"with":[128,156],"nonzero":[129],"probability,":[130],"better":[132],"feasible":[133],"solutions":[134],"than":[135],"known":[136],"before,":[137],"if":[138],"constraint":[140],"matrices":[141],"these":[143],"programs":[145],"are":[146],"column\u2010sparse":[147],"(e.g.,":[148],"routing":[149],"using":[150],"short":[151],"paths,":[152],"problems":[153],"on":[154],"hypergraphs":[155],"small":[157],"dimension/degree).":[158],"This":[159],"complements":[160],"certain":[161],"well\u2010known":[162],"results":[163,193],"discrepancy":[165],"theory.":[166],"also":[168],"generalize":[169],"method":[171],"pessimistic":[173],"estimators":[174],"(J.":[178],"Comput.":[179],"System":[180],"Sci.,":[181],"37":[182],"(1988),":[183],"130\u2013143),":[185],"obtain":[187],"constructive":[188],"(algorithmic)":[189],"versions":[190]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}