| 期刊全称 | Approximation Algorithms and Semidefinite Programming | | 影响因子2023 | Bernd Gärtner,Jiri Matousek | | 视频video | | | 发行地址 | First textbook treatment of an often-taught topic.Combines in-depth treatment of classical material with coverage of very recent developments.Every chapter comes with an extensive list of exercises.In | | 图书封面 |  | | 影响因子 | .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 “semide | | Pindex | Textbook 2012 |
The information of publication is updating
|
|
发表于 2025-3-21 17:11:10
