Marx, Dániel and Végh, LA (2013) Fixed-parameter algorithms for minimum cost edge-connectivity augmentation. In: Lecture Notes in Computer Science, 2013-07-08 - 2013-07-12, Riga, Litvánia.

Full text not available from this repository.

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.

Item Type:	Conference or Workshop Item (-)
Subjects:	Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
Depositing User:	EPrints Admin
Date Deposited:	05 Feb 2014 12:32
Last Modified:	05 Feb 2014 15:46
URI:	https://eprints.sztaki.hu/id/eprint/7702

Update Item