Marx, Dániel and Végh, LA (2013) Fixed-parameter algorithms for minimum cost edge-connectivity augmentation. In: Automata, Languages, and Programming. 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part I. Lecture Notes in Computer Science (7965). Springer-Verlag Wien, Berlin, pp. 721-732. ISBN 978-3-642-39205-4 10.1007/978-3-642-39206-1_61

Preview

Text Marx_721_2476630_ny.pdf Download (452kB) | Preview

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. © 2013 Springer-Verlag.

Update Item