Approximation Algorithms and Semidefinite Programming

This introduction to aspects of semidefinite programming and its use in approximation algorithms develops the basic theory of semidefinite programming, presents one of the known efficient algorithms in detail, and describes the principles of some others.

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	Gärtner, Bernd, Matousek, Jiri
Format:	Buch
Sprache:	eng
Schlagworte:	Algorithm Analysis and Problem Complexity Algorithms Applications of Mathematics Approximation algorithms Discrete Mathematics in Computer Science Mathematics Mathematics and Statistics Optimization Probabilities & applied mathematics Semidefinite programming Theory of Computation
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	This introduction to aspects of semidefinite programming and its use in approximation algorithms develops the basic theory of semidefinite programming, presents one of the known efficient algorithms in detail, and describes the principles of some others.
DOI:	10.1007/978-3-642-22015-9