{"paper":{"title":"Fast Approximation Algorithms for the Generalized Survivable Network Design Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS","math.CO"],"primary_cat":"math.OC","authors_text":"Andreas Emil Feldmann, Jochen K\\\"onemann, Kanstantsin Pashkovich, Laura Sanit\\`a","submitted_at":"2016-04-24T16:40:41Z","abstract_excerpt":"In a standard $f$-connectivity network design problem, we are given an undirected graph $G=(V,E)$, a cut-requirement function $f:2^V \\rightarrow {\\mathbb{N}}$, and non-negative costs $c(e)$ for all $e \\in E$. We are then asked to find a minimum-cost vector $x \\in {\\mathbb{N}}^E$ such that $x(\\delta(S)) \\geq f(S)$ for all $S \\subseteq V$. We focus on the class of such problems where $f$ is a proper function. This encodes many well-studied NP-hard problems such as the generalized survivable network design problem.\n  In this paper we present the first strongly polynomial time FPTAS for solving th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.07049","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"}