{"id":"https://openalex.org/W2084415648","doi":"https://doi.org/10.1137/s0097539704445718","title":"Integrality Ratio for Group Steiner Trees and Directed Steiner Trees","display_name":"Integrality Ratio for Group Steiner Trees and Directed Steiner Trees","publication_year":2007,"publication_date":"2007-01-01","ids":{"openalex":"https://openalex.org/W2084415648","doi":"https://doi.org/10.1137/s0097539704445718","mag":"2084415648"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539704445718","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539704445718","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/A5050273239","display_name":"Eran Halperin","orcid":"https://orcid.org/0000-0002-2373-3691"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Eran Halperin","raw_affiliation_strings":["University of California at Berkeley"],"affiliations":[{"raw_affiliation_string":"University of California at Berkeley","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056370891","display_name":"Guy Kortsarz","orcid":null},"institutions":[{"id":"https://openalex.org/I4210096112","display_name":"Rutgers Sexual and Reproductive Health and Rights","ror":"https://ror.org/00rcvgx40","country_code":"NL","type":"other","lineage":["https://openalex.org/I4210096112"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Guy Kortsarz","raw_affiliation_strings":["Rutgers Camden, Computer Science"],"affiliations":[{"raw_affiliation_string":"Rutgers Camden, Computer Science","institution_ids":["https://openalex.org/I4210096112"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5037378898","display_name":"Robert Krauthgamer","orcid":"https://orcid.org/0009-0003-8154-3735"},"institutions":[{"id":"https://openalex.org/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Robert Krauthgamer","raw_affiliation_strings":["IBM, ,"],"affiliations":[{"raw_affiliation_string":"IBM, ,","institution_ids":["https://openalex.org/I1341412227"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005118312","display_name":"Aravind Srinivasan","orcid":"https://orcid.org/0000-0002-0062-3684"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Aravind Srinivasan","raw_affiliation_strings":["University of Maryland, College Park"],"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100332725","display_name":"Nan Wang","orcid":"https://orcid.org/0000-0001-9504-5591"},"institutions":[{"id":"https://openalex.org/I2802755631","display_name":"Morgan Stanley (United States)","ror":"https://ror.org/00aphdz18","country_code":"US","type":"company","lineage":["https://openalex.org/I2802755631"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nan Wang","raw_affiliation_strings":["Morgan Stanley"],"affiliations":[{"raw_affiliation_string":"Morgan Stanley","institution_ids":["https://openalex.org/I2802755631"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5050273239"],"corresponding_institution_ids":["https://openalex.org/I95457486"],"apc_list":null,"apc_paid":null,"fwci":1.8215,"has_fulltext":false,"cited_by_count":26,"citation_normalized_percentile":{"value":0.85328914,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"36","issue":"5","first_page":"1494","last_page":"1511"},"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.9983999729156494,"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.9944000244140625,"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/steiner-tree-problem","display_name":"Steiner tree problem","score":0.9326092004776001},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8052600622177124},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6767803430557251},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.6112439632415771},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5420352816581726},{"id":"https://openalex.org/keywords/group","display_name":"Group (periodic table)","score":0.5090767741203308},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4782644510269165},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4518990218639374},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.44270992279052734},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4270952045917511},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.4263572692871094},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.4220002293586731},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41220223903656006},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.31902772188186646},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.17219889163970947}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.9326092004776001},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8052600622177124},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6767803430557251},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.6112439632415771},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5420352816581726},{"id":"https://openalex.org/C2781311116","wikidata":"https://www.wikidata.org/wiki/Q83306","display_name":"Group (periodic table)","level":2,"score":0.5090767741203308},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4782644510269165},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4518990218639374},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.44270992279052734},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4270952045917511},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.4263572692871094},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.4220002293586731},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41220223903656006},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.31902772188186646},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.17219889163970947},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"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/C178790620","wikidata":"https://www.wikidata.org/wiki/Q11351","display_name":"Organic chemistry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539704445718","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539704445718","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1966395945","https://openalex.org/W1970076003","https://openalex.org/W1997307133","https://openalex.org/W2009976792","https://openalex.org/W2014979132","https://openalex.org/W2059453880","https://openalex.org/W2107711372","https://openalex.org/W2143996311","https://openalex.org/W2166965860","https://openalex.org/W2170170950","https://openalex.org/W2610052675","https://openalex.org/W3030774092"],"related_works":["https://openalex.org/W2367195720","https://openalex.org/W1968497507","https://openalex.org/W132011890","https://openalex.org/W1998126097","https://openalex.org/W1980288485","https://openalex.org/W2009976792","https://openalex.org/W3184075718","https://openalex.org/W2995411114","https://openalex.org/W2004321562","https://openalex.org/W328736688"],"abstract_inverted_index":{"The":[0],"natural":[1,160],"relaxation":[2,157],"for":[3,12,63,101,117,152,221,230],"the":[4,15,32,39,47,56,77,102,110,118,135,140,147,153,187,218,222,238],"group":[5,40,223],"Steiner":[6,17,41,104,120,224],"tree":[7,18,42,105,225],"problem,":[8,19,43],"as":[9,11],"well":[10],"its":[13],"generalization,":[14],"directed":[16,103,119],"is":[20,50,96,166,227],"a":[21,156,159],"flow\u2010based":[22,248],"linear":[23],"programming":[24],"relaxation.":[25,37],"We":[26,213],"prove":[27],"new":[28],"lower":[29,94,137],"bounds":[30,138],"on":[31,82,139,192],"integrality":[33,48,128,141,164,219],"ratio":[34,49,142,165,220],"of":[35,58,76,84,109,113,158,186,194,233,240],"this":[36,60,93],"For":[38,130],"we":[44],"show":[45,200,215],"that":[46,66,143,205,217,250],"$\\Omega(\\log^2":[51],"k)$,":[52],"where":[53],"k":[54],"denotes":[55],"number":[57,111],"groups;":[59],"holds":[61],"even":[62],"input":[64,148],"graphs":[65],"are":[67,134,144],"hierarchically":[68],"well\u2010separated":[69],"trees,":[70],"introduced":[71],"by":[72,180,243],"Bartal":[73],"[in":[74,184],"Proceedings":[75,185],"37th":[78],"Annual":[79,189],"IEEE":[80],"Symposium":[81,191],"Foundations":[83],"Computer":[85],"Science,":[86],"1996,":[87],"pp.":[88,197],"184\u2013193],":[89],"in":[90,146],"which":[91,235],"case":[92],"bound":[95],"tight.":[97],"This":[98,150],"also":[99,214],"applies":[100],"problem.":[106],"In":[107],"terms":[108],"n":[112],"vertices,":[114],"our":[115],"results":[116,174],"problem":[121,162,226],"imply":[122],"an":[123],"$\\Omega(\\frac{\\log^2":[124],"n}{(\\log":[125],"\\log":[126],"n)^2})$":[127],"ratio.":[129],"both":[131],"problems,":[132],"these":[133],"first":[136,154],"superlogarithmic":[145,170],"size.":[149],"exhibits,":[151],"time,":[155],"optimization":[161],"whose":[163],"known":[167],"to":[168,199,246,252,256],"be":[169,253],"but":[171],"subpolynomial.":[172],"Our":[173],"and":[175,182],"techniques":[176],"have":[177],"been":[178],"used":[179],"Halperin":[181],"Krauthgamer":[183],"35th":[188],"ACM":[190],"Theory":[193],"Computing,":[195],"2003,":[196],"585\u2013594]":[198],"comparable":[201],"inapproximability":[202],"results,":[203],"assuming":[204],"NP":[206],"has":[207],"no":[208],"quasi\u2010polynomial":[209],"Las":[210],"Vegas":[211],"algorithms.":[212],"algorithmically":[216],"much":[228],"better":[229],"certain":[231],"families":[232],"instances,":[234],"helps":[236],"pinpoint":[237],"types":[239],"instances":[241],"(parametrized":[242],"optimal":[244],"solutions":[245],"their":[247],"relaxations)":[249],"appear":[251],"most":[254],"difficult":[255],"approximate.":[257]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}