Approximation algorithms and semidefinite programming
Resource Information
The work Approximation algorithms and semidefinite programming represents a distinct intellectual or artistic creation found in University of Missouri Libraries. This resource is a combination of several types including: Work, Language Material, Books.
The Resource
Approximation algorithms and semidefinite programming
Resource Information
The work Approximation algorithms and semidefinite programming represents a distinct intellectual or artistic creation found in University of Missouri Libraries. This resource is a combination of several types including: Work, Language Material, Books.
 Label
 Approximation algorithms and semidefinite programming
 Statement of responsibility
 Bernd Gärtner, Jiří Matoušek
 Subject

 Algorithms
 Applications of Mathematics
 Approximation algorithms
 Approximation algorithms
 Approximation algorithms
 Computational complexity
 Computer software
 Computer software
 Discrete Mathematics in Computer Science
 Information theory
 Mathematical optimization
 Mathematics
 Optimization
 Semidefinite programming
 Semidefinite programming
 Semidefinite programming
 Theory of Computation
 Algorithm Analysis and Problem Complexity
 Language
 eng
 Summary
 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 polynomialtime 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
 Cataloging source
 GW5XE
 Dewey number
 518/.1
 Illustrations
 illustrations
 Index
 index present
 LC call number
 QA76.9.A43
 LC item number
 G37 2012
 Literary form
 non fiction
 Nature of contents

 dictionaries
 bibliography
 NLM call number
 Online Book
Context
Context of Approximation algorithms and semidefinite programmingWork of
No resources found
No enriched resources found
Embed
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.library.missouri.edu/resource/PKDLcJsHJdY/" typeof="CreativeWork http://bibfra.me/vocab/lite/Work"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/resource/PKDLcJsHJdY/">Approximation algorithms and semidefinite programming</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Work Approximation algorithms and semidefinite programming
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.library.missouri.edu/resource/PKDLcJsHJdY/" typeof="CreativeWork http://bibfra.me/vocab/lite/Work"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/resource/PKDLcJsHJdY/">Approximation algorithms and semidefinite programming</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>