{"id":"https://openalex.org/W2600683609","doi":"https://doi.org/10.1137/16m1057486","title":"Toward a 6/5 Bound for the Minimum Cost 2-Edge Connected Spanning Subgraph","display_name":"Toward a 6/5 Bound for the Minimum Cost 2-Edge Connected Spanning Subgraph","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2600683609","doi":"https://doi.org/10.1137/16m1057486","mag":"2600683609"},"language":"en","primary_location":{"id":"doi:10.1137/16m1057486","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1057486","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":"last","author":{"id":"https://openalex.org/A5081571355","display_name":"Philippe Legault","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Philippe Legault","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.604,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.84647922,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"31","issue":"1","first_page":"632","last_page":"644"},"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.9987999796867371,"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.9987999796867371,"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.996999979019165,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9937999844551086,"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/combinatorics","display_name":"Combinatorics","score":0.7179869413375854},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7137635350227356},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.6332627534866333},{"id":"https://openalex.org/keywords/vertex-connectivity","display_name":"Vertex connectivity","score":0.6169258952140808},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.561518669128418},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.4940376877784729},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.46699705719947815},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.44177672266960144},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.42119652032852173},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.4197220504283905},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.41800954937934875},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.30555325746536255},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.23110204935073853},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.13950729370117188},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.08060172200202942},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.07656267285346985},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07240185141563416}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7179869413375854},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7137635350227356},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.6332627534866333},{"id":"https://openalex.org/C2983226441","wikidata":"https://www.wikidata.org/wiki/Q3115621","display_name":"Vertex connectivity","level":4,"score":0.6169258952140808},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.561518669128418},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.4940376877784729},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.46699705719947815},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.44177672266960144},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.42119652032852173},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.4197220504283905},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41800954937934875},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.30555325746536255},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.23110204935073853},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.13950729370117188},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.08060172200202942},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.07656267285346985},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07240185141563416},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/16m1057486","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1057486","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1999799345","https://openalex.org/W2038458261","https://openalex.org/W2038858023","https://openalex.org/W2048952924","https://openalex.org/W2077642252","https://openalex.org/W2172955861","https://openalex.org/W2300052872"],"related_works":["https://openalex.org/W2684541573","https://openalex.org/W3211984451","https://openalex.org/W2569968971","https://openalex.org/W3105736412","https://openalex.org/W4300109452","https://openalex.org/W1967548269","https://openalex.org/W2067078311","https://openalex.org/W2790408044","https://openalex.org/W1577105815","https://openalex.org/W2077502829"],"abstract_inverted_index":{"Given":[0],"a":[1,20,92],"complete":[2],"graph":[3],"$K_{n}=(V,":[4],"E)$":[5],"with":[6],"nonnegative":[7],"edge":[8],"costs":[9],"$c\\in":[10],"{\\mathbb":[11],"R}^{E}$,":[12],"the":[13,36,63,67,75,102,113],"problem":[14],"2EC":[15,43],"is":[16,119],"that":[17,55,98,112],"of":[18,25,27,35,65,69,77,95],"finding":[19],"2-edge":[21],"connected":[22],"spanning":[23],"multisubgraph":[24],"$K_{n}$":[26],"minimum":[28],"cost.":[29],"The":[30],"integrality":[31,104],"gap":[32,105],"$\\alpha\\text{2{\\it":[33,85,115],"EC}}$":[34],"linear":[37],"programming":[38],"relaxation":[39],"$\\text{2{\\it":[40,72,107],"EC}}^{\\text{LP}}$":[41,73],"for":[42,71,84,106,121],"has":[44],"been":[45],"conjectured":[46],"to":[47,80,100],"be":[48],"$\\frac{6}{5}$,":[49],"although":[50],"currently":[51],"we":[52,61],"only":[53],"know":[54],"$\\frac{6}{5}\\leq\\alpha\\text{2{\\it":[56],"EC}}\\leq\\frac{3}{2}$.":[57],"In":[58],"this":[59],"paper,":[60],"explore":[62],"idea":[64],"using":[66],"structure":[68],"solutions":[70,97],"and":[74],"concept":[76],"convex":[78],"combination":[79],"obtain":[81],"improved":[82],"bounds":[83],"EC}}$.":[86],"We":[87,109],"focus":[88],"our":[89],"efforts":[90],"on":[91],"family":[93],"$J$":[94],"half-integer":[96],"appear":[99],"give":[101],"largest":[103],"EC}}^{\\text{LP}}$.":[108],"successfully":[110],"show":[111],"conjecture":[114],"EC}}":[116],"=":[117],"\\frac{6}{5}$":[118],"true":[120],"any":[122],"cost":[123],"functions":[124],"optimized":[125],"by":[126],"some":[127],"$x^{*}\\in":[128],"J$.":[129]},"counts_by_year":[{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}