{"id":"https://openalex.org/W3167765036","doi":"https://doi.org/10.1145/3406325.3451056","title":"A nearly-linear time algorithm for linear programs with small treewidth: a multiscale representation of robust central path","display_name":"A nearly-linear time algorithm for linear programs with small treewidth: a multiscale representation of robust central path","publication_year":2021,"publication_date":"2021-06-15","ids":{"openalex":"https://openalex.org/W3167765036","doi":"https://doi.org/10.1145/3406325.3451056","mag":"3167765036"},"language":"en","primary_location":{"id":"doi:10.1145/3406325.3451056","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3406325.3451056","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-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/A5017229799","display_name":"Sally Dong","orcid":null},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Sally Dong","raw_affiliation_strings":["University of Washington, USA"],"affiliations":[{"raw_affiliation_string":"University of Washington, USA","institution_ids":["https://openalex.org/I201448701"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024980585","display_name":"Yin Tat Lee","orcid":null},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]},{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yin Tat Lee","raw_affiliation_strings":["University of Washington, USA / Microsoft Research, USA"],"affiliations":[{"raw_affiliation_string":"University of Washington, USA / Microsoft Research, USA","institution_ids":["https://openalex.org/I1290206253","https://openalex.org/I201448701"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047330517","display_name":"Guanghao Ye","orcid":null},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Guanghao Ye","raw_affiliation_strings":["University of Washington, USA"],"affiliations":[{"raw_affiliation_string":"University of Washington, USA","institution_ids":["https://openalex.org/I201448701"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5017229799"],"corresponding_institution_ids":["https://openalex.org/I201448701"],"apc_list":null,"apc_paid":null,"fwci":1.8175,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.87105868,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1784","last_page":"1797"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9975000023841858,"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":0.9975000023841858,"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.996399998664856,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9926000237464905,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.9446190595626831},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.8117102384567261},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5942969918251038},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5158669352531433},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.48017898201942444},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4501981735229492},{"id":"https://openalex.org/keywords/partial-k-tree","display_name":"Partial k-tree","score":0.4492432773113251},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4480286240577698},{"id":"https://openalex.org/keywords/tree-depth","display_name":"Tree-depth","score":0.4192710518836975},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.413925439119339},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.402632474899292},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40017327666282654},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.38531503081321716},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.2826298773288727},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1165066659450531}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.9446190595626831},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.8117102384567261},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5942969918251038},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5158669352531433},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48017898201942444},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4501981735229492},{"id":"https://openalex.org/C128764233","wikidata":"https://www.wikidata.org/wiki/Q7140374","display_name":"Partial k-tree","level":5,"score":0.4492432773113251},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4480286240577698},{"id":"https://openalex.org/C69284658","wikidata":"https://www.wikidata.org/wiki/Q7837500","display_name":"Tree-depth","level":5,"score":0.4192710518836975},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.413925439119339},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.402632474899292},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40017327666282654},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38531503081321716},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.2826298773288727},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1165066659450531},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C94625758","wikidata":"https://www.wikidata.org/wiki/Q7163","display_name":"Politics","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3406325.3451056","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3406325.3451056","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2023598280","display_name":null,"funder_award_id":"CCF-1749609,CCF-1740551, DMS-1839116, DMS-2023166","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G293049584","display_name":null,"funder_award_id":"Microsoft Research Faculty Fellowship","funder_id":"https://openalex.org/F4320308943","funder_display_name":"Microsoft Research"},{"id":"https://openalex.org/G8120747972","display_name":null,"funder_award_id":"Sloan Research Fellowship","funder_id":"https://openalex.org/F4320306151","funder_display_name":"Alfred P. Sloan Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320306079","display_name":"David and Lucile Packard Foundation","ror":"https://ror.org/032atxq54"},{"id":"https://openalex.org/F4320306151","display_name":"Alfred P. Sloan Foundation","ror":"https://ror.org/052csg198"},{"id":"https://openalex.org/F4320308943","display_name":"Microsoft Research","ror":"https://ror.org/00d0nc645"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":43,"referenced_works":["https://openalex.org/W789853836","https://openalex.org/W1520511539","https://openalex.org/W1632601927","https://openalex.org/W1997901185","https://openalex.org/W2014730252","https://openalex.org/W2018804864","https://openalex.org/W2020880764","https://openalex.org/W2027562075","https://openalex.org/W2033040247","https://openalex.org/W2050448951","https://openalex.org/W2056228264","https://openalex.org/W2069291005","https://openalex.org/W2070232376","https://openalex.org/W2071362870","https://openalex.org/W2076680677","https://openalex.org/W2080234606","https://openalex.org/W2080654168","https://openalex.org/W2089898547","https://openalex.org/W2137541800","https://openalex.org/W2140514146","https://openalex.org/W2162150822","https://openalex.org/W2224152264","https://openalex.org/W2346816364","https://openalex.org/W2423358376","https://openalex.org/W2734278384","https://openalex.org/W2773660891","https://openalex.org/W2962921664","https://openalex.org/W2963423025","https://openalex.org/W2963934882","https://openalex.org/W2964181913","https://openalex.org/W2986773320","https://openalex.org/W3002603762","https://openalex.org/W3034220602","https://openalex.org/W3034810578","https://openalex.org/W3035520095","https://openalex.org/W3043760594","https://openalex.org/W3116248644","https://openalex.org/W3117221493","https://openalex.org/W3129191225","https://openalex.org/W4230551286","https://openalex.org/W4231154391","https://openalex.org/W4254261743","https://openalex.org/W4291286745"],"related_works":["https://openalex.org/W1836127928","https://openalex.org/W2027388354","https://openalex.org/W1490290385","https://openalex.org/W1539278744","https://openalex.org/W1572255008","https://openalex.org/W2084535634","https://openalex.org/W2584271047","https://openalex.org/W1576158606","https://openalex.org/W1973972417","https://openalex.org/W2949315077"],"abstract_inverted_index":{"Arising":[0],"from":[1],"structural":[2],"graph":[3,92],"theory,":[4],"treewidth":[5,33,95],"has":[6,94],"become":[7],"a":[8,60,78,98],"focus":[9],"of":[10,34,56,81],"study":[11],"in":[12,24,41,46,109],"fixed-parameter":[13],"tractable":[14],"algorithms.":[15],"Many":[16],"NP-hard":[17],"problems":[18,40],"are":[19,64],"known":[20],"to":[21,53,106],"be":[22,44],"solvable":[23,45],"O(n":[25,47],"\u00b7":[26,48],"2O(\u03c4))":[27],"time,":[28],"where":[29],"\u03c4":[30],"is":[31],"the":[32,35,54,82],"input":[36],"graph.":[37],"Analogously,":[38],"many":[39],"P":[42],"should":[43],"\u03c4O(1))":[49],"time;":[50],"however,":[51],"due":[52],"lack":[55],"appropriate":[57],"tools,":[58],"only":[59],"few":[61],"such":[62],"results":[63],"currently":[65],"known.":[66],"In":[67],"our":[68],"paper,":[69],"we":[70,103],"show":[71,104],"this":[72],"holds":[73],"for":[74],"linear":[75,79],"programs:":[76],"Given":[77],"program":[80],"form":[83],"minAx=b,\u2113":[84],"\u2264":[85],"x\u2264":[86],"u":[87],"c\u22a4":[88],"x":[89],"whose":[90],"dual":[91],"GA":[93],"\u03c4,":[96],"and":[97],"corresponding":[99],"width-\u03c4":[100],"tree":[101],"decomposition,":[102],"how":[105],"solve":[107],"it":[108],"time":[110]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}