Voting algorithms for unique games on complete graphs

An approximation algorithm for a constraint satisfaction problem is called robust if it outputs an assignment satisfying a $(1 - f(\epsilon))$-fraction of the constraints on any $(1-\epsilon)$-satisfiable instance, where the loss function $f$ is such that $f(\epsilon) \rightarrow 0$ as $\epsilon \ri...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Méot, Antoine, de Mesmay, Arnaud, Mühlenthaler, Moritz, Newman, Alantha
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Data Structures and Algorithms
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!