Marx, Dániel and Végh, László A. 
ORCID: 0000-0003-1152-200X
(2013)
Fixed-parameter algorithms for minimum cost edge-connectivity augmentation.
In: Fomin, Fedor V., Freivalds, Rūsiņš, Kwiatkowska, Marta and Peleg, David, (eds.)
Automata, Languages, and Programming: 40th International Colloquium, Icalp 2013, Riga, Latvia, July 8-12, 2013.
Lecture notes in computer science (7965).
Springer Berlin / Heidelberg, Berlin, pp. 721-732.
ISBN 9783642392054
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.
| Item Type: | Book Section |
|---|---|
| Official URL: | http://link.springer.com/bookseries/558 |
| Additional Information: | © 2013 Springer-Verlag |
| Divisions: | Management |
| Subjects: | Q Science > QA Mathematics Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
| Date Deposited: | 05 Aug 2013 08:20 |
| Last Modified: | 11 Dec 2024 17:40 |
| URI: | http://eprints.lse.ac.uk/id/eprint/51380 |
Actions (login required)
 |
View Item |
