Library Header Image
LSE Research Online LSE Library Services

Fixed-parameter algorithms for minimum-cost edge-connectivity augmentation

Marx, Dániel and Végh, László A. ORCID: 0000-0003-1152-200X (2015) Fixed-parameter algorithms for minimum-cost edge-connectivity augmentation. ACM Transactions on Algorithms, 11 (4). p. 27. ISSN 1549-6325

PDF - Accepted Version
Download (499kB) | Preview

Identification Number: 10.1145/2700210


We consider connectivity-augmentation problems in a setting where each potential new edge has a non-negative cost associated with it, and the task is to achieve a certain connectivity target with at most p new edges of minimum total cost. The main result is that the minimum cost augmentation of edge-connectivity from k − 1 to k with at most p new edges is fixed-parameter tractable parameterized by p and admits a polynomial kernel. We also prove the fixed-parameter tractability of increasing edge connectivity from 0 to 2 and increasing node connectivity from 1 to 2.

Item Type: Article
Official URL:
Additional Information: © 2015 ACM
Divisions: Mathematics
Subjects: Q Science > QA Mathematics
Date Deposited: 09 Feb 2017 14:04
Last Modified: 16 May 2024 02:10

Actions (login required)

View Item View Item


Downloads per month over past year

View more statistics