Towards Optimal Integrality Gaps for Hypergraph Vertex Cover in the Lovász-Schrijver Hierarchy

“Lift-and-project” procedures, which tighten linear relaxations over many rounds, yield many of the celebrated approximation algorithms of the past decade or so, even after only a constant number of rounds (e.g., for max-cut, max-3sat and sparsest-cut). Thus proving super-constant round lowerbounds...

Ausführliche Beschreibung

Bibliographische Detailangaben

1. Verfasser:	Tourlakis, Iannis
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Algorithmics. Computability. Computer arithmetics Applied sciences Computer science control theory systems Disjoint Pair Distant Pair Exact sciences and technology Flows in networks. Combinatorial problems Linear Relaxation Operational research and scientific management Operational research. Management science Theoretical computing Uniform Hypergraph Vertex Cover
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!