Approximation Algorithms and Semidefinite Programming
by Bernd Gärtner and Jiri Matousek
From $79.19 / copy at 25+ copies; lower per-copy prices at higher quantities (see Volume pricing) As low as $77.39 at 100+
Total $1,979.75
Format
The more copies, the less each one costs
Applied automatically in your cart. No code needed.
Built for school and campus orders
PDF quotes, purchase orders, tax exemption and multi-site delivery, handled by one account manager.
PDF quotes, purchase orders, tax exemption and help with vendor setup.
For schools Make it yoursBookplates, tipped-in pages, belly bands or author signatures. Subject to publisher approval.
Customization options Ship to every readerOne address, many sites or individual recipients' homes, in the US and abroad.
Fulfillment optionsApproximation Algorithms and Semidefinite Programming
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.
Details
- Publisher
- Springer Berlin Heidelberg
- Authors
- Bernd Gärtner, Jiri Matousek
- Format
- Hardcover
- Published
- Jan 13, 2012
- ISBN-13
- 9783642220142
- Pages
- 251
- Printing
- Printed on demand
Approximation Algorithms and Semidefinite Programming for groups: pricing
Volume pricing applies automatically in your cart. No codes, no account needed.
| Copies | Price per copy | You save |
|---|---|---|
| 25 – 49 | $79.19 | 12% off list |
| 50 – 99 | $78.29 | 13% off list |
| 100+ | $77.39 | 14% off list |
Popular for
A copy for every student in the class or section.
Shared reading for professional development.
Common reads and first-year programs.
Where can I buy 100 copies of Approximation Algorithms and Semidefinite Programming?
BookPal sells Approximation Algorithms and Semidefinite Programming in quantity. At 100 copies the price is $77.39 a copy, against a list price of $89.99, and the cart applies the volume tier automatically. Free shipping on most orders over $95 in the contiguous US. A specialist can quote a larger or mixed order.
- New books only, straight from the publisher
- Volume prices apply automatically in the cart, with no code needed
- Order at least 10 business days before you need the books (11 from mid-November through December)
What does Approximation Algorithms and Semidefinite Programming cost when I buy for a group?
Volume pricing applies automatically in your cart, with no code needed. Price per copy: 25 to 49 copies, $79.19 (12% off list); 50 to 99 copies, $78.29 (13% off list); 100+ copies, $77.39 (14% off list). Need a different quantity, or a quote to forward for approval? Ask a specialist and we will confirm pricing before you pay.
How fast can I get copies of Approximation Algorithms and Semidefinite Programming?
This title is printed on demand, so it needs production time before it ships. Need them by a specific date? Request a quote and we'll confirm timing before you pay.
Can you ship to several locations or people's homes?
Yes. We ship group orders to one address, to multiple sites, or to individual recipients, in the US and internationally. See fulfillment options.
Can I get a formal quote for approval before ordering?
Yes. Request a quote and we'll send a PDF you can forward for approval.
Do you accept purchase orders and tax-exempt orders?
Yes. We accept purchase orders upon approval, as well as cards, PayPal, ACH, wire transfers and checks. BookPal is a tax-exempt supplier in all 50 states. See purchase orders and sales tax exemption.
What if I find a lower price?
Send us the link. We match prices from other booksellers and distributors on a new copy in the same edition, available to ship in the quantity you need. Clearance sales and pricing errors are the exception, and we'll tell you quickly if that's the case. Start a price match.
Write a Review
Approximation Algorithms and Semidefinite Programming
Groups also order




A colleague asked you to approve this order
Your quote list
Add books as you browse, then request one quote for all of them.