Campus Event Calendar
Event Entry
What and Who
Parameterized Complexity of Connectivity Augmentation problems
Pranabendu Misra
Max-Planck-Institut für Informatik - D1
AG1 Mittagsseminar (own work)
AG 1, MMCI
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Tuesday, 12 February 2019
13:00
30 Minutes
E1 4
024
Saarbrücken
Abstract
We consider the parameterized complexity of the following problem.
Given a \lambda-edge connected graph G(V,E) and a set L \subseteq V \times V, can we add at most k edges from L to G to make it \lambda+1-edge connected. This is a well studied problem in approximation algorithms. In this talk we will see some parameterized algorithms for this problem.
Contact
Nitin Saurabh
--email hidden
passcode not visible
logged in users only
Nitin Saurabh, 02/11/2019 10:58 -- Created document.