The Resource Approximation algorithms and semidefinite programming, Bernd Gärtner, Jiří Matoušek
Approximation algorithms and semidefinite programming, Bernd Gärtner, Jiří Matoušek
Resource Information
The item Approximation algorithms and semidefinite programming, Bernd Gärtner, Jiří Matoušek represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.This item is available to borrow from 1 library branch.
Resource Information
The item Approximation algorithms and semidefinite programming, Bernd Gärtner, Jiří Matoušek represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.
This item is available to borrow from 1 library branch.
 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
 Language
 eng
 Extent
 1 online resource (xi, 251 pages)
 Contents

 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 interiorpoint algorithm for semidefinite programming
 7. Copositive programming
 8. Lower bounds for the GoemansWilliamson MaxCut algorithm
 9. Coloring 3chromatic 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
 Isbn
 9783642220159
 Label
 Approximation algorithms and semidefinite programming
 Title
 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
 http://library.link/vocab/creatorName
 Gärtner, Bernd
 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
 http://library.link/vocab/relatedWorkOrContributorDate
 1963
 http://library.link/vocab/relatedWorkOrContributorName
 Matoušek, Jiří
 http://library.link/vocab/subjectName

 Approximation algorithms
 Semidefinite programming
 Algorithms
 Approximation algorithms
 Semidefinite programming
 Label
 Approximation algorithms and semidefinite programming, Bernd Gärtner, Jiří Matoušek
 Antecedent source
 unknown
 Bibliography note
 Includes bibliographical references (pages 239244) and index
 Carrier category
 online resource
 Carrier category code

 cr
 Carrier MARC source
 rdacarrier
 Color
 multicolored
 Content category
 text
 Content type code

 txt
 Content type MARC source
 rdacontent
 Contents
 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 interiorpoint algorithm for semidefinite programming  7. Copositive programming  8. Lower bounds for the GoemansWilliamson MaxCut algorithm  9. Coloring 3chromatic 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
 Control code
 773812724
 Dimensions
 unknown
 Extent
 1 online resource (xi, 251 pages)
 File format
 unknown
 Form of item
 online
 Isbn
 9783642220159
 Level of compression
 unknown
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code

 c
 Other control number
 10.1007/9783642220159
 Other physical details
 illustrations
 Quality assurance targets
 not applicable
 Reformatting quality
 unknown
 Sound
 unknown sound
 Specific material designation
 remote
 System control number
 (OCoLC)773812724
 Label
 Approximation algorithms and semidefinite programming, Bernd Gärtner, Jiří Matoušek
 Antecedent source
 unknown
 Bibliography note
 Includes bibliographical references (pages 239244) and index
 Carrier category
 online resource
 Carrier category code

 cr
 Carrier MARC source
 rdacarrier
 Color
 multicolored
 Content category
 text
 Content type code

 txt
 Content type MARC source
 rdacontent
 Contents
 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 interiorpoint algorithm for semidefinite programming  7. Copositive programming  8. Lower bounds for the GoemansWilliamson MaxCut algorithm  9. Coloring 3chromatic 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
 Control code
 773812724
 Dimensions
 unknown
 Extent
 1 online resource (xi, 251 pages)
 File format
 unknown
 Form of item
 online
 Isbn
 9783642220159
 Level of compression
 unknown
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code

 c
 Other control number
 10.1007/9783642220159
 Other physical details
 illustrations
 Quality assurance targets
 not applicable
 Reformatting quality
 unknown
 Sound
 unknown sound
 Specific material designation
 remote
 System control number
 (OCoLC)773812724
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
Genre
Library Links
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/portal/Approximationalgorithmsandsemidefinite/3KDPB5b66ss/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/Approximationalgorithmsandsemidefinite/3KDPB5b66ss/">Approximation algorithms and semidefinite programming, Bernd Gärtner, Jiří Matoušek</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 Item Approximation algorithms and semidefinite programming, Bernd Gärtner, Jiří Matoušek
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/portal/Approximationalgorithmsandsemidefinite/3KDPB5b66ss/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/Approximationalgorithmsandsemidefinite/3KDPB5b66ss/">Approximation algorithms and semidefinite programming, Bernd Gärtner, Jiří Matoušek</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>