{"id":"https://openalex.org/W4401122432","doi":"https://doi.org/10.1145/3681791","title":"Polynomial Integrality Gap of Flow LP for Directed Steiner Tree","display_name":"Polynomial Integrality Gap of Flow LP for Directed Steiner Tree","publication_year":2024,"publication_date":"2024-07-30","ids":{"openalex":"https://openalex.org/W4401122432","doi":"https://doi.org/10.1145/3681791"},"language":"en","primary_location":{"id":"doi:10.1145/3681791","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3681791","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3681791","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3681791","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100430766","display_name":"Shi Li","orcid":"https://orcid.org/0000-0001-9140-9415"},"institutions":[{"id":"https://openalex.org/I36399199","display_name":"Nanjing University of Science and Technology","ror":"https://ror.org/00xp9wg62","country_code":"CN","type":"education","lineage":["https://openalex.org/I36399199"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Shi Li","raw_affiliation_strings":["Department of Computer Science and Technology, Nanjing University, Nanjing, China"],"raw_orcid":"https://orcid.org/0000-0001-9140-9415","affiliations":[{"raw_affiliation_string":"Department of Computer Science and Technology, Nanjing University, Nanjing, China","institution_ids":["https://openalex.org/I36399199"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005632876","display_name":"Bundit Laekhanukit","orcid":"https://orcid.org/0000-0002-4476-8914"},"institutions":[{"id":"https://openalex.org/I181679659","display_name":"Shanghai University of Finance and Economics","ror":"https://ror.org/00wtvfq62","country_code":"CN","type":"education","lineage":["https://openalex.org/I181679659"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Bundit Laekhanukit","raw_affiliation_strings":["Institute for Theoretical Computer Science, Department of Information Management and Engineering, Shanghai University of Finance and Economics, Shanghai, China"],"raw_orcid":"https://orcid.org/0000-0002-4476-8914","affiliations":[{"raw_affiliation_string":"Institute for Theoretical Computer Science, Department of Information Management and Engineering, Shanghai University of Finance and Economics, Shanghai, China","institution_ids":["https://openalex.org/I181679659"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100430766"],"corresponding_institution_ids":["https://openalex.org/I36399199"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.14180519,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"21","issue":"1","first_page":"1","last_page":"9"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9980999827384949,"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.9980999827384949,"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/combinatorics","display_name":"Combinatorics","score":0.798947811126709},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7140905857086182},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.7116188406944275},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6068047285079956},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.595710039138794},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.5304930210113525},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5253971219062805},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5121631622314453},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.500551700592041},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.44298240542411804},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4292987585067749},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41730254888534546},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.41377970576286316},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.411251038312912},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3819039463996887},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37322282791137695},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.23916658759117126},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.15385371446609497},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.14715677499771118},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.11019405722618103}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.798947811126709},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7140905857086182},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.7116188406944275},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6068047285079956},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.595710039138794},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.5304930210113525},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5253971219062805},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5121631622314453},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.500551700592041},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.44298240542411804},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4292987585067749},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41730254888534546},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.41377970576286316},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.411251038312912},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3819039463996887},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37322282791137695},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.23916658759117126},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.15385371446609497},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.14715677499771118},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.11019405722618103},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3681791","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3681791","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3681791","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3681791","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3681791","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3681791","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8939654172","display_name":null,"funder_award_id":"61932002","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4401122432.pdf"},"referenced_works_count":14,"referenced_works":["https://openalex.org/W1586797185","https://openalex.org/W1977712294","https://openalex.org/W1991055327","https://openalex.org/W2005771129","https://openalex.org/W2009976792","https://openalex.org/W2016332468","https://openalex.org/W2027515293","https://openalex.org/W2070664846","https://openalex.org/W2084415648","https://openalex.org/W2228866060","https://openalex.org/W2295961103","https://openalex.org/W2900307033","https://openalex.org/W2933187735","https://openalex.org/W3002615297"],"related_works":["https://openalex.org/W2367195720","https://openalex.org/W1968497507","https://openalex.org/W2035522910","https://openalex.org/W132011890","https://openalex.org/W2005615533","https://openalex.org/W1998126097","https://openalex.org/W1980288485","https://openalex.org/W2114997377","https://openalex.org/W2963158951","https://openalex.org/W2070751425"],"abstract_inverted_index":{"In":[0],"the":[1,73,88,103,107,114,119,131,135,167,173,186,194,203,207],"Directed":[2],"Steiner":[3],"Tree":[4],"(DST)":[5],"problem,":[6],"we":[7,101,191],"are":[8],"given":[9],"a":[10,22,29,41,48,61,69,198],"directed":[11],"graph":[12],"\\(G=(V,E)\\)":[13],"on":[14,172,206],"\\(n\\)":[15,184],"vertices":[16],"with":[17,159],"edge-costs":[18],"\\(c\\in{\\mathbb{R}}_{\\geq":[19],"0}^{E}\\)":[20],",":[21,27,86,185],"root":[23],"vertex":[24],"\\(r\\in":[25],"V\\)":[26],"and":[28,87,152],"set":[30],"\\(K\\subseteq":[31],"V\\setminus\\{r\\}\\)":[32],"of":[33,44,78,93,106,127,134,176,188,196],"\\(k\\)":[34],"terminals.":[35],"The":[36],"goal":[37],"is":[38,68,137,181],"to":[39,52,140],"find":[40],"minimum-cost":[42],"subgraph":[43],"\\(G\\)":[45],"that":[46,118,180],"contains":[47],"path":[49],"from":[50],"\\(r\\)":[51],"every":[53],"terminal":[54],"\\(t\\in":[55],"K\\)":[56],".":[57,96,129,163],"DST":[58],"has":[59,123],"been":[60],"notorious":[62],"problem":[63,204],"for":[64,80,113,202],"decades":[65],"as":[66],"there":[67],"large":[70],"gap":[71,105,126,133,175],"between":[72],"best-known":[74],"polynomial-time":[75],"approximation":[76,91,200],"ratio":[77,92],"\\(O(k^{\\epsilon})\\)":[79],"any":[81],"constant":[82],"\\(\\epsilon":[83],"\\gt":[84],"0\\)":[85],"best":[89],"quasi-polynomial-time":[90],"\\(O\\left(\\frac{\\log^{2}k}{\\log\\log":[94],"k}\\right)\\)":[95],"Toward":[97],"understanding":[98],"this":[99,177],"gap,":[100],"study":[102],"integrality":[104,125,132,174],"standard":[108,178],"flow":[109,208],"linear":[110,120],"programming":[111],"relaxation":[112],"problem.":[115],"We":[116],"show":[117],"program":[121],"(LP)":[122],"an":[124],"\\(\\Omega(n^{0.0418})\\)":[128],"Previously,":[130],"LP":[136,179,209],"only":[138],"known":[139,169],"be":[141],"\\(\\Omega\\left(\\frac{\\log^{2}n}{\\log\\log":[142],"n}\\right)\\)":[143,162],"[Halperin":[144],"et":[145],"al.,":[146],"SODA\u201903":[147],"&":[148],"SIAM":[149],"J.":[150],"Comput.]":[151],"\\(\\Omega(\\sqrt{k})\\)":[153],"[Zosin-Khuller,":[154],"SODA\u201902]":[155],"in":[156,183],"some":[157],"instance":[158],"\\(\\sqrt{k}=O\\left(\\frac{\\log":[160],"n}{\\log\\log":[161],"Our":[164],"result":[165],"gives":[166],"first":[168],"lower":[170],"bound":[171],"polynomial":[182],"number":[187],"vertices.":[189],"Consequently,":[190],"rule":[192],"out":[193],"possibility":[195],"developing":[197],"poly-logarithmic":[199],"algorithm":[201],"based":[205],"relaxation.":[210]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}