---

＜電子ブック＞
Approximation Algorithms and Semidefinite Programming / by Bernd Gärtner, Jiri Matousek

版	1st ed. 2012.
出版者	(Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer)
出版年	2012
本文言語	英語
大きさ	XI, 251 p : online resource
著者標目	*Gärtner, Bernd author Matousek, Jiri author SpringerLink (Online service)
件　名	LCSH:Mathematics LCSH:Computer science LCSH:Algorithms LCSH:Computer science -- Mathematics  全ての件名で検索 LCSH:Discrete mathematics LCSH:Mathematical optimization FREE:Applications of Mathematics FREE:Theory of Computation FREE:Algorithms FREE:Discrete Mathematics in Computer Science FREE:Optimization
一般注記	Part I (by Bernd Gärtner): 1 Introduction: MAXCUT via Semidefinite Programming -- 2 Semidefinite Programming -- 3 Shannon Capacity and Lovász Theta.-  4 Duality and Cone Programming.-  5 Approximately Solving Semidefinite Programs -- 6 An Interior-Point Algorithm for Semidefinite Programming -- 7 Compositive Programming.-  Part II (by Jiri Matousek): 8 Lower Bounds for the Goemans–Williamson MAXCUT Algorithm -- 9 Coloring 3-Chromatic Graphs -- 10 Maximizing a Quadratic Form on a Graph -- 11 Colorings With Low Discrepancy -- 12 Constraint Satisfaction Problems, and Relaxing Them Semidefinitely -- 13 Rounding Via Miniatures -- Summary -- References -- Index Semidefinite programs constitute one of the largest classes of optimization problems that can be solved with reasonable efficiency - both in theory and practice. They play a key role in a variety of research areas, such as combinatorial optimization, approximation algorithms, computational complexity, graph theory, geometry, real algebraic geometry and quantum computing. This book is an introduction to selected aspects of semidefinite programming and its use in approximation algorithms. It covers the basics but also a significant amount of recent and more advanced material.   There are many computational problems, such as MAXCUT, for which one cannot reasonably expect to obtain an exact solution efficiently, and in such case, one has to settle for approximate solutions. For MAXCUT and its relatives, exciting recent results suggest that semidefinite programming is probably the ultimate tool. Indeed, assuming the Unique Games Conjecture, a plausible but as yet unproven hypothesis, it was shown that for these problems, known algorithms based on semidefinite programming deliver the best possible approximation ratios among all polynomial-time algorithms.   This book follows the “semidefinite side” of these developments, presenting some of the main ideas behind approximation algorithms based on semidefinite programming. It develops the basic theory of semidefinite programming, presents one of the known efficient algorithms in detail, and describes the principles of some others. It also includes applications, focusing on approximation algorithms HTTP:URL=https://doi.org/10.1007/978-3-642-22015-9

 類似資料