Max-Planck-Institut für Informatik
max planck institut
mpii logo Minerva of the Max Planck Society

MPI-INF or MPI-SWS or Local Campus Event Calendar

<< Previous Entry Next Entry >> New Event Entry Edit this Entry Login to DB (to update, delete)
What and Who
Title:Parameterized Complexity of Connectivity Augmentation problems
Speaker:Pranabendu Misra
coming from:Max-Planck-Institut für Informatik - D1
Speakers Bio:
Event Type:AG1 Mittagsseminar (own work)
Visibility:D1, MMCI
We use this to send out email in the morning.
Level:AG Audience
Date, Time and Location
Date:Tuesday, 12 February 2019
Duration:30 Minutes
Building:E1 4
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.

Name(s):Nitin Saurabh
Video Broadcast
Video Broadcast:NoTo Location:
Tags, Category, Keywords and additional notes
Attachments, File(s):

Nitin Saurabh, 02/11/2019 10:58 AM
Last modified:
Uwe Brahm/MPII/DE, 02/12/2019 07:01 AM
  • Nitin Saurabh, 02/11/2019 10:58 AM -- Created document.