| 000 -LEADER |
|---|
| fixed length control field |
03880nam a22005055i 4500 |
| 003 - CONTROL NUMBER IDENTIFIER |
|---|
| control field |
OSt |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20140310151457.0 |
| 007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION |
|---|
| fixed length control field |
cr nn 008mamaa |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
120109s2012 gw | s |||| 0|eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9783642220159 |
|
978-3-642-22015-9 |
| 050 #4 - LIBRARY OF CONGRESS CALL NUMBER |
|---|
| Classification number |
T57-57.97 |
| 082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER |
|---|
| Classification number |
519 |
| Edition number |
23 |
| 264 #1 - |
|---|
| -- |
Berlin, Heidelberg : |
| -- |
Springer Berlin Heidelberg, |
| -- |
2012. |
| 912 ## - |
|---|
| -- |
ZDB-2-SMA |
| 100 1# - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Gärtner, Bernd. |
| Relator term |
author. |
| 245 10 - IMMEDIATE SOURCE OF ACQUISITION NOTE |
|---|
| Title |
Approximation Algorithms and Semidefinite Programming |
| Medium |
[electronic resource] / |
| Statement of responsibility, etc |
by Bernd Gärtner, Jiri Matousek. |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
XII, 252 p. |
| Other physical details |
online resource. |
| 505 0# - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
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. |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc |
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. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Mathematics. |
|
|---|
| Topical term or geographic name as entry element |
Information theory. |
|
|---|
| Topical term or geographic name as entry element |
Computer software. |
|
|---|
| Topical term or geographic name as entry element |
Computational complexity. |
|
|---|
| Topical term or geographic name as entry element |
Algorithms. |
|
|---|
| Topical term or geographic name as entry element |
Mathematical optimization. |
|
|---|
| Topical term or geographic name as entry element |
Mathematics. |
|
|---|
| Topical term or geographic name as entry element |
Applications of Mathematics. |
|
|---|
| Topical term or geographic name as entry element |
Theory of Computation. |
|
|---|
| Topical term or geographic name as entry element |
Algorithm Analysis and Problem Complexity. |
|
|---|
| Topical term or geographic name as entry element |
Discrete Mathematics in Computer Science. |
|
|---|
| Topical term or geographic name as entry element |
Algorithms. |
|
|---|
| Topical term or geographic name as entry element |
Optimization. |
| 700 1# - ADDED ENTRY--PERSONAL NAME |
|---|
| Personal name |
Matousek, Jiri. |
| Relator term |
author. |
| 710 2# - ADDED ENTRY--CORPORATE NAME |
|---|
| Corporate name or jurisdiction name as entry element |
SpringerLink (Online service) |
| 773 0# - HOST ITEM ENTRY |
|---|
| Title |
Springer eBooks |
| 776 08 - ADDITIONAL PHYSICAL FORM ENTRY |
|---|
| Display text |
Printed edition: |
| International Standard Book Number |
9783642220142 |
| 856 40 - ELECTRONIC LOCATION AND ACCESS |
|---|
| Uniform Resource Identifier |
http://dx.doi.org/10.1007/978-3-642-22015-9 |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Source of classification or shelving scheme |
|
| Item type |
E-Book |
