{"paper":{"title":"Toward a 6/5 Bound for the Minimum Cost 2-Edge Connected Spanning Subgraph Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Philippe Legault, Sylvia Boyd","submitted_at":"2015-12-26T04:12:11Z","abstract_excerpt":"Given a complete graph $K_{n}=(V, E)$ with non-negative edge costs $c\\in {\\mathbb R}^{E}$, the problem $2EC$ is that of finding a 2-edge connected spanning multi-subgraph of $K_{n}$ of minimum cost. The integrality gap $\\alpha\\text{2EC}$ of the linear programming relaxation $\\text{2EC}^{\\text{LP}}$ for $2EC$ has been conjectured to be $\\frac{6}{5}$, although currently we only know that $\\frac{6}{5}\\leq\\alpha\\text{2EC}\\leq\\frac{3}{2}$. In this paper, we explore the idea of using the structure of solutions for $\\text{2EC}^{\\text{LP}}$ and the concept of convex combination to obtain improved boun"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.08070","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}