{"id":"https://openalex.org/W2083162966","doi":"https://doi.org/10.1137/080732572","title":"Iterated Rounding Algorithms for the Smallest <i>k</i>-Edge Connected Spanning Subgraph","display_name":"Iterated Rounding Algorithms for the Smallest <i>k</i>-Edge Connected Spanning Subgraph","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W2083162966","doi":"https://doi.org/10.1137/080732572","mag":"2083162966"},"language":"en","primary_location":{"id":"doi:10.1137/080732572","is_oa":false,"landing_page_url":"https://doi.org/10.1137/080732572","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/A5001013961","display_name":"Harold N. Gabow","orcid":"https://orcid.org/0000-0002-9775-3492"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Harold N. Gabow","raw_affiliation_strings":["hal@cs.colorado.edu and suzanne@cs.colorado.edu#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"hal@cs.colorado.edu and suzanne@cs.colorado.edu#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5057273619","display_name":"Suzanne Renick Gallagher","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Suzanne R. Gallagher","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6946,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.72684356,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"41","issue":"1","first_page":"61","last_page":"103"},"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.9993000030517578,"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.9980000257492065,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.8306005597114563},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7925536036491394},{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.7537944316864014},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6847299337387085},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5795261263847351},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5221510529518127},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.4706413447856903},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43912526965141296},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4217846393585205},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.41916608810424805},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1496778130531311},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1105106770992279},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.06481269001960754}],"concepts":[{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.8306005597114563},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7925536036491394},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.7537944316864014},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6847299337387085},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5795261263847351},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5221510529518127},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.4706413447856903},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43912526965141296},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4217846393585205},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.41916608810424805},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1496778130531311},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1105106770992279},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.06481269001960754},{"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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/080732572","is_oa":false,"landing_page_url":"https://doi.org/10.1137/080732572","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":7,"referenced_works":["https://openalex.org/W1988128001","https://openalex.org/W1990865893","https://openalex.org/W2037686175","https://openalex.org/W2092113566","https://openalex.org/W2134875769","https://openalex.org/W2172955861","https://openalex.org/W4240507476"],"related_works":["https://openalex.org/W2059680011","https://openalex.org/W2905721092","https://openalex.org/W1974452921","https://openalex.org/W2003116146","https://openalex.org/W2952492560","https://openalex.org/W3153944538","https://openalex.org/W4300632873","https://openalex.org/W3089776415","https://openalex.org/W4287184993","https://openalex.org/W2083162966"],"abstract_inverted_index":{"We":[0],"present":[1],"the":[2,8,43,84,101,130,176,184,194],"best":[3],"known":[4,158],"algorithms":[5],"for":[6,37,69,115,125,160],"approximating":[7],"minimum-size":[9,177],"undirected":[10],"k-edge":[11,71],"connected":[12,72],"spanning":[13],"subgraph.":[14],"For":[15,117],"simple":[16,70],"graphs":[17],"our":[18,119],"approximation":[19,120,165,172],"ratio":[20,46,103,121,132,166,173],"is":[21,81,122,152,157],"$1+":[22],"{1}/(2k)":[23],"+":[24,89],"O({1}/{k^2})$.":[25],"The":[26,59,108,188],"more":[27],"precise":[28],"version":[29],"of":[30,47,77,104,153,193],"this":[31],"bound":[32,86],"requires":[33],"$k\\ge":[34],"7$,":[35],"and":[36,49,106,142],"all":[38],"such":[39],"k":[40,79,182],"it":[41,156],"improves":[42,100,129],"long-standing":[44],"performance":[45,102],"Cheriyan":[48,105],"Thurimella":[50],"[SIAM":[51],"J.":[52],"Comput.,":[53],"30":[54],"(2000),":[55],"pp.":[56,149],"528\u2013560],":[57],"$1+2/(k+1)$.":[58],"improvement":[60],"comes":[61],"in":[62,199],"two":[63,196],"steps.":[64],"First":[65],"we":[66],"show":[67],"that":[68,97,159],"graphs,":[73],"any":[74,126],"laminar":[75],"family":[76],"degree":[78],"sets":[80],"smaller":[82],"than":[83],"general":[85],"($n(1+":[87],"{3}/{k}":[88],"O(1/k\\sqrt":[90],"k))$":[91],"versus":[92],"$2n$).":[93],"This":[94,128],"immediately":[95],"implies":[96,169],"iterated":[98,200],"rounding":[99,191],"Thurimella.":[107],"second":[109],"step":[110],"carefully":[111],"chooses":[112],"good":[113],"edges":[114],"rounding.":[116,201],"multigraphs":[118],"$1+(21/11)k":[123],"<1+1.91/k$":[124],"$k>1$.":[127],"previous":[131],"$1+2/k$":[133],"[H.":[134],"N.":[135],"Gabow,":[136],"M.":[137],"X.":[138],"Goemans,":[139],"E.":[140],"Tardos,":[141],"D.":[143],"P.":[144],"Williamson,":[145],"Networks,":[146],"53":[147],"(2009),":[148],"345\u2013357].":[150],"It":[151],"interest":[154],"since":[155],"some":[161],"constant":[162],"$c>0$,":[163],"an":[164],"$\\le":[167],"1+c/k$":[168],"$P=NP$.":[170],"Our":[171],"extends":[174],"to":[175],"Steiner":[178],"network":[179],"problem,":[180],"where":[181],"denotes":[183],"average":[185],"vertex":[186],"demand.":[187],"algorithm":[189],"exploits":[190],"properties":[192],"first":[195],"linear":[197],"programs":[198]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}