{"paper":{"title":"A simplified 1.5-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Guy Kortsarz, Zeev Nutov","submitted_at":"2015-07-10T08:10:40Z","abstract_excerpt":"The Tree Augmentation Problem (TAP) is: given a connected graph $G=(V,{\\cal E})$ and an edge set $E$ on $V$ find a minimum size subset of edges $F \\subseteq E$ such that $(V,{\\cal E} \\cup F)$ is $2$-edge-connected. In the conference version \\cite{EFKN-APPROX} was sketched a $1.5$-approximation algorithm for the problem. Since a full proof was very complex and long, the journal version was cut into two parts. In the first part \\cite{EFKN-TALG} was only proved ratio $1.8$. An attempt to simplify the second part produced an error in \\cite{EKN-IPL}. Here we give a correct, different, and self cont"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02799","kind":"arxiv","version":1},"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"}