Approximation Algorithms
From $87.12 / copy at 25+ copies; lower per-copy prices at higher quantities (see Volume pricing) As low as $85.14 at 100+
Total $2,178.00
Format
The more copies, the less each one costs
Applied automatically in your cart. No code needed.
Turn this order into a program
Groups that order together often pair the copies with something more. We handle the extras so you don't have to.
Bookplates, 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 options Pair it with a branded journalJournals with your logo or each reader's name, for the same group.
Branded journalsBookPal is partnering with Talezo to help you find and book authors, speakers and performers for your event.
BookPal × TalezoApproximation Algorithms
Most natural optimization problems, including those arising in important application areas, are NP-hard. Therefore, under the widely believed conjecture that P≠NP, their exact solution is prohibitively time consuming. Charting the landscape of approximability of these problems, via polynomial-time algorithms, therefore becomes a compelling subject of scientific inquiry in computer science and mathematics. This book presents the theory of approximation algorithms.
This book is divided into three parts. Part I covers combinatorial algorithms for a number of important problems, using a wide variety of algorithm design techniques. Part II presents linear programming based algorithms. These are categorized under two fundamental techniques: rounding and the primal-dual schema. Part III covers four important topics: the first is the problem of finding a shortest vector in a lattice; the second is the approximability of counting, as opposed to optimization, problems; the third topic is centered around recent breakthrough results, establishing hardness of approximation for many key problems, and giving new legitimacy to approximation algorithms as a deep theory; and the fourth topic consists of the numerous open problems of this young field.
This book is suitable for use in advanced undergraduate and graduate-level courses on approximation algorithms. An undergraduate course in algorithms and the theory of NP-completeness should suffice as a prerequisite for most of the chapters. This book can also be used as supplementary text in basic undergraduate and graduate algorithms courses.
Details
- Publisher
- Springer Berlin Heidelberg
- Author
- Vijay V. Vazirani
- Format
- Hardcover
- Published
- Jul 2, 2001
- ISBN-13
- 9783540653677
- Pages
- 380
Approximation Algorithms for groups: pricing
Volume pricing applies automatically in your cart. No codes, no account needed.
| Copies | Price per copy | You save |
|---|---|---|
| 25 – 49 | $87.12 | 12% off list |
| 50 – 99 | $86.13 | 13% off list |
| 100+ | $85.14 | 14% off list |
Popular for
For new managers and leadership cohorts, a chapter per session.
A shared vocabulary for the whole organization.
A takeaway attendees will actually read, delivered to your venue.
Where can I buy 100 copies of Approximation Algorithms?
BookPal sells Approximation Algorithms in quantity. At 100 copies the price is $85.14 a copy, against a list price of $99.00, 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 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, $87.12 (12% off list); 50 to 99 copies, $86.13 (13% off list); 100+ copies, $85.14 (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?
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
Teams 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.