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:Parameters of Two-Prover-One-Round Game and The Hardness of Connectivity Problems
Speaker:Bundit Laekhanukit
coming from:IDSIA, Switzerland
Speakers Bio:
Event Type:AG1 Mittagsseminar (own work)
Visibility:D1, D2, D3, D4, D5, RG1, SWS, MMCI
We use this to send out email in the morning.
Level:AG Audience
Date, Time and Location
Date:Thursday, 7 May 2015
Duration:30 Minutes
Building:E1 4
We investigate the connection between the parameters of

Two-Prover-One-Round Game (2P1R) and the hardness of approximating
connectivity problems. Based on the recent development on 2P1R by Chan
(STOC 2013), we improve hardness of connectivity problems that are in
the form k^delta, for some small constant delta>0, to hardness of the
form k^c for some explicit constant c, where k is a connectivity
parameter. Moreover, we prove hardness in terms of the number of
demand pairs for the target problems. This improves upon the known
hardness results of the rooted k-connectivity, vertex-connectivity
survivable network design and vertex-connectivity k-route-cut

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

Parinya Chalermsook, 04/20/2015 01:13 PM
Last modified:
Uwe Brahm/MPII/DE, 11/24/2016 04:13 PM
  • Parinya Chalermsook, 04/28/2015 11:57 AM
  • Parinya Chalermsook, 04/20/2015 01:13 PM -- Created document.