Fixedparameter algorithms for minimum cost edgeconnectivity augmentation
Marx, Dániel and Végh, LA (2013) Fixedparameter algorithms for minimum cost edgeconnectivity augmentation. In: Automata, Languages, and Programming. 40th International Colloquium, ICALP 2013, Riga, Latvia, July 812, 2013, Proceedings, Part I. Lecture Notes in Computer Science (7965). SpringerVerlag Wien, Berlin, pp. 721732. ISBN 9783642392054 10.1007/9783642392061_61

Text
Marx_721_2476630_ny.pdf Download (452kB)  Preview 
Abstract
We consider connectivityaugmentation 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 edgeconnectivity from k1 to k with at most p new edges is fixedparameter tractable parameterized by p and admits a polynomial kernel. We also prove the fixedparameter tractability of increasing edgeconnectivity from 0 to 2, and increasing nodeconnectivity from 1 to 2. © 2013 SpringerVerlag.
Item Type:  Book Section 

Subjects:  Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány 
Divisions:  Informatics Laboratory 
SWORD Depositor:  MTMT Injector 
Depositing User:  MTMT Injector 
Date Deposited:  07 Feb 2018 07:01 
Last Modified:  21 Jul 2019 13:45 
URI:  https://eprints.sztaki.hu/id/eprint/9351 
Update Item 