Fixed-Parameter algorithms for minimum cost edge-connectivity augmentation

Authors:
Dániel Marx;László A. Végh
Affiliations:
Computer and Automation Research Institute, Hungarian Academy of Sciences (MTA SZTAKI), Budapest, Hungary;Department of Management, London School of Economics, London, UK
Venue:
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Year:
2013

Citing 16
Cited 0

An application of simultaneous Diophantine approximation in combinatorial optimization

Combinatorica
Edge-connectivity augmentation problems

Journal of Computer and System Sciences
Augmenting graphs to meet edge-connectivity requirements

SIAM Journal on Discrete Mathematics
On the optimal vertex-connectivity augmentation

Journal of Combinatorial Theory Series B
When Trees Collide: An Approximation Algorithm for theGeneralized Steiner Problem on Networks

SIAM Journal on Computing
A General Approximation Technique for Constrained Forest Problems

SIAM Journal on Computing
Minimal edge-coverings of pairs of sets

Journal of Combinatorial Theory Series B
On four-connecting a triconnected graph

Journal of Algorithms
Otakar Borůvka on minimum spanning tree problem translation of both the 1926 papers, comments, history

Discrete Mathematics
An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree

Discrete Applied Mathematics - Special issue: Special issue devoted to the fifth annual international computing and combinatories conference (COCOON'99) Tokyo, Japan 26-28 July 1999
Independence free graphs and vertex connectivity augmentation

Journal of Combinatorial Theory Series B
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)

Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Kernelization and complexity results for connectivity augmentation problems

Networks
Lower bounds on kernelization

Discrete Optimization
Kernelization --- preprocessing with a guarantee

The Multivariate Algorithmic Revolution and Beyond
Parameterized Complexity

Parameterized Complexity

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider connectivity-augmentation problems in a setting where each potential new edge has a nonnegative 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.