Weitere Informationen

MALOC Event Series

3439 1446721298

Magdeburg Lectures on Optimization and Control: No Small Linear Program Approximates Vertex Cover within a Factor 2-ε

  • Datum: 08.12.2015
  • Uhrzeit: 17:00 - 19:00
  • Vortragender: Prof. Dr. Samuel Fiorini
  • Université Libre de Bruxelles
  • Ort: Lukasklause (Otto-von-Guericke-Zentrum) Magdeburg
  • Gastgeber: veranstaltet von den Fakultäten für Elektrotechnik, für Mathematik und dem Forschungszentrum Dynamische Systeme der OVGU sowie dem MPI Magdeburg
  • Kontakt: malocmailinglist-l@ovgu.de
The vertex cover problem is one of the most important and intensively studied combinatorial optimization problems. Khot and Regev (2003) proved that the problem is NP-hard to approximate within a factor 2-ε, assuming Khot's famous Unique Games Conjecture (UGC). This is tight because the problem has an easy 2-approximation algorithm. We prove the following unconditional result about linear programming (LP) relaxations of the problem: every LP relaxation that approximates vertex cover within a factor 2-ε has super-polynomially many inequalities.
 
loading content