{"id":"https://openalex.org/W4288432777","doi":"https://doi.org/10.1137/20m1372822","title":"A $\\frac{4}{3}$-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case","display_name":"A $\\frac{4}{3}$-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case","publication_year":2022,"publication_date":"2022-07-28","ids":{"openalex":"https://openalex.org/W4288432777","doi":"https://doi.org/10.1137/20m1372822"},"language":"en","primary_location":{"id":"doi:10.1137/20m1372822","is_oa":false,"landing_page_url":"https://doi.org/10.1137/20m1372822","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"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 Discrete Mathematics","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/A5025268829","display_name":"Sylvia Boyd","orcid":"https://orcid.org/0000-0001-7884-0219"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sylvia Boyd","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046805470","display_name":"Joseph Cheriyan","orcid":"https://orcid.org/0000-0003-0316-7650"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Joseph Cheriyan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036288137","display_name":"Robert Cummings","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Robert Cummings","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5073958617","display_name":"Logan Grout","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Logan Grout","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5004186037","display_name":"Sharat Ibrahimpur","orcid":"https://orcid.org/0000-0002-1575-9648"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sharat Ibrahimpur","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-1575-9648","affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5107639953","display_name":"Zolt\u00e1n Szigeti","orcid":null},"institutions":[{"id":"https://openalex.org/I4210094718","display_name":"Laboratoire des Sciences pour la Conception, l'Optimisation et la Production","ror":"https://ror.org/00rv5x925","country_code":"FR","type":"facility","lineage":["https://openalex.org/I106785703","https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I4210094718","https://openalex.org/I4210159245","https://openalex.org/I899635006","https://openalex.org/I899635006"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Zolt\u00e1n Szigeti","raw_affiliation_strings":["G-SCOP_OC - Optimisation Combinatoire (46 Avenue F\u00e9lix Viallet 38001 GRENOBLE Cedex 1 - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"G-SCOP_OC - Optimisation Combinatoire (46 Avenue F\u00e9lix Viallet 38001 GRENOBLE Cedex 1 - France)","institution_ids":["https://openalex.org/I4210094718"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100364530","display_name":"Lu Wang","orcid":"https://orcid.org/0000-0003-2669-3522"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lu Wang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1437,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.47564638,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"36","issue":"3","first_page":"1730","last_page":"1747"},"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.9987000226974487,"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.9987000226974487,"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.9986000061035156,"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"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9936000108718872,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/mathematics","display_name":"Mathematics","score":0.7844375967979431},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7617753744125366},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.47668910026550293},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.45127952098846436},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4294887185096741},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.42122605443000793},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.19398698210716248}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7844375967979431},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7617753744125366},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.47668910026550293},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.45127952098846436},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4294887185096741},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.42122605443000793},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19398698210716248}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/20m1372822","is_oa":false,"landing_page_url":"https://doi.org/10.1137/20m1372822","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"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 Discrete Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-03860876v1","is_oa":false,"landing_page_url":"https://hal.science/hal-03860876","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Discrete Mathematics, 2022, 36 (3), pp.1730-1747. ⟨10.1137/20M1372822⟩","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1504912078","https://openalex.org/W1714357736","https://openalex.org/W1971486128","https://openalex.org/W1990900182","https://openalex.org/W1999799345","https://openalex.org/W2009695707","https://openalex.org/W2020163691","https://openalex.org/W2038458261","https://openalex.org/W2048952924","https://openalex.org/W2063836932","https://openalex.org/W2100440346","https://openalex.org/W2158560363","https://openalex.org/W2172955861","https://openalex.org/W2300052872","https://openalex.org/W2325833190","https://openalex.org/W2600683609","https://openalex.org/W2621304102","https://openalex.org/W2912794399","https://openalex.org/W2920960746","https://openalex.org/W3035071390","https://openalex.org/W3167350281"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W1525389557","https://openalex.org/W2361554335","https://openalex.org/W2164188042","https://openalex.org/W2359992618","https://openalex.org/W4306878646","https://openalex.org/W2051378252","https://openalex.org/W4296605418","https://openalex.org/W4385493656","https://openalex.org/W1553492721"],"abstract_inverted_index":{"Given":[0,141],"a":[1,21,56,71,96,111,135,142,158,175,180,187,202,209],"connected":[2,23,104,160,183,190,212],"undirected":[3],"graph":[4,191],"$\\overline{G}$":[5,27,164],"on":[6,49,59],"$n$":[7],"vertices":[8],"and":[9,76,120],"nonnegative":[10],"edge":[11,197],"costs":[12,198],"$c$,":[13],"the":[14,41,45,50,60,81,91,115,147],"$\\ensuremath{{2ECM}}$":[15],"problem":[16,48,177],"is":[17,68,84,222],"that":[18,80,90,207],"of":[19,26,28,53,99,102,107,114,126,163,178,186,216],"finding":[20,179],"2-edge":[22,103,159,182,211],"spanning":[24,105,161,184,213],"multisubgraph":[25,162],"minimum":[29],"cost.":[30,62],"The":[31],"natural":[32],"linear":[33],"program":[34],"(LP)":[35],"for":[36,44,138,149],"$\\ensuremath{{2ECM}}$,":[37,150],"which":[38],"coincides":[39],"with":[40,165,195],"subtour":[42],"LP":[43,67,148],"traveling":[46],"salesman":[47],"metric":[51],"closure":[52],"$\\overline{G}$,":[54],"gives":[55],"lower":[57],"bound":[58],"optimal":[61],"For":[63],"instances":[64],"where":[65],"this":[66],"optimized":[69],"by":[70,122],"half-integral":[72,139,143],"solution":[73,144],"$x$,":[74],"Carr":[75,119],"Ravi":[77,121],"(1998)":[78],"showed":[79],"integrality":[82],"gap":[83],"at":[85,167,223],"most":[86,168,224],"$\\frac43$:":[87],"they":[88],"show":[89],"vector":[92],"$\\frac43":[93,169],"x$":[94],"dominates":[95],"convex":[97],"combination":[98],"incidence":[100],"vectors":[101],"multisubgraphs":[106],"$\\overline{G}$.":[108],"We":[109,172,200],"present":[110],"simpler":[112],"proof":[113,131],"result":[116],"due":[117],"to":[118,134,146,156],"applying":[123],"an":[124,153],"extension":[125],"Lov\u00e1sz's":[127],"splitting-off":[128],"theorem.":[129],"Our":[130],"naturally":[132],"leads":[133],"$\\frac43$-approximation":[136],"algorithm":[137,155,206],"instances.":[140],"$x$":[145],"we":[151],"give":[152,201],"$O(n^2)$-time":[154],"obtain":[157],"cost":[166],"c^T":[170],"x$.":[171],"also":[173],"consider":[174],"related":[176],"cheap":[181],"subgraph":[185,214],"3-regular,":[188],"3-edge":[189],"$G":[192],"=":[193],"(V,E)$":[194],"arbitrary":[196],"$c$.":[199],"polynomial-time":[203],"Las":[204],"Vegas":[205],"finds":[208],"random":[210],"$H$":[215],"$G$":[217],"whose":[218],"expected":[219],"cost,":[220],"$\\mathbb{E}\\left[{c(H)}\\right]$,":[221],"$\\frac45":[225],"c(E)$.":[226]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2022-07-29T00:00:00"}