MPI-INF Logo
Campus Event Calendar

Event Entry

What and Who

Parameters of Two-Prover-One-Round Game and The Hardness of Connectivity Problems

Bundit Laekhanukit
IDSIA, Switzerland
AG1 Mittagsseminar (own work)
AG 1, AG 2, AG 3, AG 4, AG 5, RG1, SWS, MMCI  
AG Audience
English

Date, Time and Location

Thursday, 7 May 2015
13:00
30 Minutes
E1 4
024
Saarbrücken

Abstract

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
problems.

Contact

Parinya Chalermsook
--email hidden
passcode not visible
logged in users only

Parinya Chalermsook, 04/28/2015 11:57
Parinya Chalermsook, 04/20/2015 13:13 -- Created document.