Feldmann, A.E. orcid.org/0000-0001-6229-5332, Könemann, J., Pashkovich, K. et al. (1 more author) (2016) Fast approximation algorithms for the generalized survivable network design problem. In: Hong, S., (ed.) Leibniz International Proceedings in Informatics, LIPIcs. 27th International Symposium on Algorithms and Computation (ISAAC 2016), 12-14 Dec 2016, Sydney, Australia. Leibniz International Proceedings in Informatics, 64 . Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik , Dagstuhl, Germany , 33.1-33.12. ISBN 978-3-95977-026-2
Abstract
In a standard f-connectivity network design problem, we are given an undirected graph G = (V, E), a cut-requirement function f : 2V → N, and non-negative costs c(e) for all e ∈ E. We are then asked to find a minimum-cost vector x ∈ ℕE such that x(δ(S)) ≥ f(S) for all S ⊆ 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. In this paper we present the first strongly polynomial time FPTAS for solving the LP relaxation of the standard IP formulation of the f-connectivity problem with general proper functions f. Implementing Jain's algorithm, this yields a strongly polynomial time (2 + ε)-approximation for the generalized survivable network design problem (where we consider rounding up of rationals an arithmetic operation).
Metadata
Item Type: | Proceedings Paper |
---|---|
Authors/Creators: |
|
Editors: |
|
Copyright, Publisher and Additional Information: | © 2016 The authors. This is an Open Access article distributed under the terms of the Creative Commons Attribution Licence (https://creativecommons.org/licenses/by/3.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. |
Keywords: | strongly polynomial runtime; generalized survivable network design; primal-dual method |
Dates: |
|
Institution: | The University of Sheffield |
Academic Units: | The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Computer Science (Sheffield) |
Depositing User: | Symplectic Sheffield |
Date Deposited: | 28 Jun 2023 15:08 |
Last Modified: | 28 Jun 2023 15:08 |
Status: | Published |
Publisher: | Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik |
Series Name: | Leibniz International Proceedings in Informatics |
Refereed: | Yes |
Identification Number: | 10.4230/LIPIcs.ISAAC.2016.33 |
Related URLs: | |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:200963 |