{"paper":{"title":"A $\\frac{3}{2}$-Approximation Algorithm for Tree Augmentation via Chv\\'atal-Gomory Cuts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Jochen K\\\"onemann, Laura Sanit\\`a, Martin Gro{\\ss}, Samuel Fiorini","submitted_at":"2017-02-18T03:46:55Z","abstract_excerpt":"The weighted tree augmentation problem (WTAP) is a fundamental network design problem. We are given an undirected tree $G = (V,E)$, an additional set of edges $L$ called links and a cost vector $c \\in \\mathbb{R}^L_{\\geq 1}$. The goal is to choose a minimum cost subset $S \\subseteq L$ such that $G = (V, E \\cup S)$ is $2$-edge-connected. In the unweighted case, that is, when we have $c_\\ell = 1$ for all $\\ell \\in L$, the problem is called the tree augmentation problem (TAP).\n  Both problems are known to be APX-hard, and the best known approximation factors are $2$ for WTAP by (Frederickson and J"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05567","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"}