Auszug
In Abschnitt 6.2 hatten wir Max-SAT durch ein ganzzahliges Lineares Optimierungsproblem (ILP) beschrieben, dann eine Relaxierung dieses ILP gelöst und schließlich durch die Technik des Randomized Rounding eine zulässige Lösung bestimmt. Ganz ähnlich waren wir in Abschnitt 6.4 bei der Lösung von Max-CUT vorgegangen.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
7.6 Literatur zu Kapitel 7
S. Arora and C. Lund. Hardness of approximations. In D. S. Hochbaum, editor, Approximation Algorithms for NP-Hard Problems, pages 399–46. PWS, 1996.
U. Feige and G. Schechtman. On the optimality of the random hyperplane rounding technique for MAX CUT. Random Structures & Algorithms, 20:403–140, 2002.
M. R. Garey and D. S. Johnson. Computers and Intractability — A Guide to the Theory of NP-Completeness. Freeman, New York, 1979.
M. X. Goemans and D. P. Williamson. The primai-duai method for approximation algorithms and its application to network design methods. In D. S. Hochbaum, editor, Approximation Algorithms for NP-Hard Problems, pages 144–191. PWS, 1996.
D. Hochbaum. Approximating covering and packing problems: set cover, vertex cover, independent set, and related problems. In D. S. Hochbaum, editor, Approximation Algorithms for NP-Hard Problems, pages 94–143. PWS, 1996.
D. E. Knuth. The Art of Computer Programming, Volume 1: Fundamental Algorithms. Addison-Wesley, Reading, Massachusetts, 3rd edition, 1997.
C. H. Papadimitriou and K. Steiglitz. Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, 1982.
Rights and permissions
Copyright information
© 2006 B.G. Teubner Verlag / GWV Fachverlage GmbH, Wiesbaden
About this chapter
Cite this chapter
(2006). Lineare Optimierung und Approximationsalgorithmen. In: Approximationsalgorithmen. Teubner. https://doi.org/10.1007/978-3-8351-9067-2_7
Download citation
DOI: https://doi.org/10.1007/978-3-8351-9067-2_7
Publisher Name: Teubner
Print ISBN: 978-3-519-00444-8
Online ISBN: 978-3-8351-9067-2
eBook Packages: Computer Science and Engineering (German Language)