Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, July 10, 2014, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Alexandra Kolla (University of Illinois at Urbana-Champaign)

Bottlenecks and Approaches for Refuting the Unique Games Conjecture

In this talk, I will discuss recent algorithms for the Unique Games Conjecture and explain why one of the strongest algorithms we know fails when the constrain graph is the boolean hypercube. Seen as the hypercube is a basic "bottleneck" to our understanding of how to design good algorithms for Unique Games, it is important to be able to solve UG on it. I will present a few different approaches on resolving UGC on the cube and show an integrality gap which explains why we cannot hope that the simple SDP algorithm of Goemans Williamson (which solves MaxCut exactly on the cube) fails. I will then discuss how we expect stronger SDPs to perform on the cube and conjecture that a certain SDP based algorithm approximates UGC on the hypercube very well.

This talk is based on joint past and ongoing work with Luca Trevisan, Guy Kindler, Naman Agarwal, Leonard Schulman and Aram Harrow.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login