{"id":"https://openalex.org/W1983504442","doi":"https://doi.org/10.1137/s0097539700379760","title":"New Algorithmic Aspects of the Local Lemma with Applications to Routing and Partitioning","display_name":"New Algorithmic Aspects of the Local Lemma with Applications to Routing and Partitioning","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W1983504442","doi":"https://doi.org/10.1137/s0097539700379760","mag":"1983504442"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539700379760","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539700379760","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/A5113572159","display_name":"Tom Leighton","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Tom Leighton","raw_affiliation_strings":["Mathematics Department and the Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Mathematics Department and the Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA#TAB#","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Chi-Jen Lu","orcid":null},"institutions":[{"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":false,"raw_author_name":"Chi-Jen Lu","raw_affiliation_strings":["NEC Research institute, 4 Independence Way, Princeton, NJ#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"NEC Research institute, 4 Independence Way, Princeton, NJ#TAB#","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103783564","display_name":"Satish Rao","orcid":null},"institutions":[{"id":"https://openalex.org/I165932596","display_name":"National University of Singapore","ror":"https://ror.org/01tgyzw49","country_code":"SG","type":"education","lineage":["https://openalex.org/I165932596"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Satish Rao","raw_affiliation_strings":["School of Computing, National University of Singapore, Singapore, 119260"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computing, National University of Singapore, Singapore, 119260","institution_ids":["https://openalex.org/I165932596"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005118312","display_name":"Aravind Srinivasan","orcid":"https://orcid.org/0000-0002-0062-3684"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Aravind Srinivasan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.3279,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.79586039,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"31","issue":"2","first_page":"626","last_page":"641"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":1.0,"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/T10374","display_name":"Advanced Graph Theory Research","score":1.0,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9995999932289124,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9991999864578247,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/lemma","display_name":"Lemma (botany)","score":0.8293920159339905},{"id":"https://openalex.org/keywords/constructive","display_name":"Constructive","score":0.8231686353683472},{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.720794141292572},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6503291130065918},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5754570960998535},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.5329257845878601},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4676843285560608},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4160385727882385},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.33048322796821594},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32598641514778137},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3123120665550232}],"concepts":[{"id":"https://openalex.org/C2777759810","wikidata":"https://www.wikidata.org/wiki/Q149316","display_name":"Lemma (botany)","level":3,"score":0.8293920159339905},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.8231686353683472},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.720794141292572},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6503291130065918},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5754570960998535},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.5329257845878601},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4676843285560608},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4160385727882385},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33048322796821594},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32598641514778137},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3123120665550232},{"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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"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/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.0},{"id":"https://openalex.org/C46757340","wikidata":"https://www.wikidata.org/wiki/Q43238","display_name":"Poaceae","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/s0097539700379760","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539700379760","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:CiteSeerX.psu:10.1.1.28.4775","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.28.4775","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.iis.sinica.edu.tw/~cjlu/pub/llrs.ps","raw_type":"text"},{"id":"mag:1983504442","is_oa":false,"landing_page_url":"https://epubs.siam.org/doi/pdf/10.1137/S0097539700379760","pdf_url":null,"source":{"id":"https://openalex.org/S4306420974","display_name":"Symposium on Discrete Algorithms","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Symposium on Discrete Algorithms","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W1544141825","https://openalex.org/W1572702333","https://openalex.org/W1591562949","https://openalex.org/W1921591048","https://openalex.org/W1992974842","https://openalex.org/W1998400388","https://openalex.org/W2002737611","https://openalex.org/W2015232621","https://openalex.org/W2016602690","https://openalex.org/W2022191808","https://openalex.org/W2022392080","https://openalex.org/W2028436310","https://openalex.org/W2040785801","https://openalex.org/W2041884875","https://openalex.org/W2042587503","https://openalex.org/W2056069725","https://openalex.org/W2059570262","https://openalex.org/W2063844956","https://openalex.org/W2068871408","https://openalex.org/W2092081780","https://openalex.org/W2103012681","https://openalex.org/W2106198334","https://openalex.org/W2108736261","https://openalex.org/W2117174437","https://openalex.org/W2125278290","https://openalex.org/W2128452148","https://openalex.org/W2146017177","https://openalex.org/W2152453230","https://openalex.org/W2159255281","https://openalex.org/W2295428206","https://openalex.org/W2400180097","https://openalex.org/W2752853835","https://openalex.org/W2915399289","https://openalex.org/W3011766368","https://openalex.org/W4210485603","https://openalex.org/W4233413206"],"related_works":["https://openalex.org/W2032312374","https://openalex.org/W2054019901","https://openalex.org/W2009970369","https://openalex.org/W2128452148","https://openalex.org/W2068871408","https://openalex.org/W2057427520","https://openalex.org/W2016602690","https://openalex.org/W2963625630","https://openalex.org/W2590881197","https://openalex.org/W2586408513","https://openalex.org/W791309213","https://openalex.org/W3107205237","https://openalex.org/W2175174233","https://openalex.org/W1608540139","https://openalex.org/W2795065148","https://openalex.org/W2057010576","https://openalex.org/W2752799771","https://openalex.org/W2956118321","https://openalex.org/W231253947","https://openalex.org/W2291051684"],"abstract_inverted_index":{"The":[0,19,73],"Lov\u00e1sz":[1],"local":[2],"lemma":[3,21],"(LLL)":[4],"is":[5,10,130],"a":[6,13,24,131],"powerful":[7],"tool":[8],"that":[9],"increasingly":[11],"playing":[12],"valuable":[14],"role":[15],"in":[16,104],"computer":[17],"science.":[18],"original":[20],"was":[22],"nonconstructive;":[23],"breakthrough":[25],"of":[26,51,53,68,70,78,81,84,120,127],"Beck":[27],"and":[28,34,36,90],"its":[29],"generalizations":[30],"(due":[31],"to":[32,40,65],"Alon":[33],"Molloy":[35],"Reed)":[37],"have":[38],"led":[39],"constructive":[41,76,113],"versions.":[42],"However,":[43],"these":[44],"methods":[45],"do":[46],"not":[47],"capture":[48],"some":[49],"classes":[50],"applications":[52,69,80],"the":[54,71,85,94,117],"LLL.":[55,72],"We":[56],"make":[57],"progress":[58],"on":[59,100,116],"this":[60],"by":[61],"providing":[62],"algorithmic":[63,98],"approaches":[64],"two":[66],"families":[67],"first":[74],"provides":[75,96],"versions":[77],"certain":[79,121],"an":[82],"extension":[83],"LLL":[86],"(modeling,":[87],"e.g.,":[88],"hypergraph-partitioning":[89],"low-congestion":[91],"routing":[92],"problems);":[93],"second":[95],"new":[97],"results":[99,107],"constructing":[101],"disjoint":[102],"paths":[103],"graphs.":[105],"Our":[106],"can":[108],"also":[109],"be":[110],"seen":[111],"as":[112],"upper":[114],"bounds":[115],"integrality":[118],"gap":[119],"packing":[122],"problems.":[123],"One":[124],"common":[125],"theme":[126],"our":[128],"work":[129],"\"gradual":[132],"rounding\"":[133],"approach.":[134]},"counts_by_year":[],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}