Approximation Algorithms (Paperback)
Language: English
Published by Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Berlin, 2010
- First Edition
- Softcover
- New
Seller: AussieBookSeller, Truganina, VIC, AustraliaAussieBookSeller
AbeBooks seller since June 22, 2007
Condition: New
£ 89.54
Quantity: 1 available
Add to basketItem description from seller
Paperback. Most natural optimization problems, including those arising in important application areas, are NP-hard. Therefore, under the widely believed conjecture that PNP, 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. Part I covers combinatorial algorithms for a number of important problems, using a wide variety of algorithm design techniques. 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; Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.…
Seller Inventory # 9783642084690
- Title
- Approximation Algorithms (Paperback)
- Author
- Vijay V. Vazirani
- Publisher
- Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Berlin
- Publication year
- 2010
- Condition
- new
- Binding
- Paperback
- Language
- English
- ISBN 10
- 3642084699
- ISBN 13
- 9783642084690
- Edition
- 1st Edition
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.
"Synopsis" may belong to another edition of this title.
From the Back Cover
This book covers the dominant theoretical approaches to the approximate solution of hard combinatorial optimization and enumeration problems. It contains elegant combinatorial theory, useful and interesting algorithms, and deep results about the intrinsic complexity of combinatorial problems. Its clarity of exposition and excellent selection of exercises will make it accessible and appealing to all those with a taste for mathematics and algorithms.
Richard Karp,University Professor, University of California at Berkeley
Following the development of basic combinatorial optimization techniques in the 1960s and 1970s, a main open question was to develop a theory of approximation algorithms. In the 1990s, parallel developments in techniques for designing approximation algorithms as well as methods for proving hardness of approximation results have led to a beautiful theory. The need to solve truly large instances of computationally hard problems, such as those arising from the Internet or the human genome project, has also increased interest in this theory. The field is currently very active, with the toolbox of approximation algorithm design techniques getting always richer.
It is a pleasure to recommend Vijay Vazirani's well-written and comprehensive book on this important and timely topic. I am sure the reader will find it most useful both as an introduction to approximability as well as a reference to the many aspects of approximation algorithms.
László Lovász, Senior Researcher, Microsoft Research
"About the title" may belong to another edition of this title.
AussieBookSeller
Truganina, VIC, Australia
AbeBooks seller since June 22, 2007
Shipping rates from Australia to U.S.A.
| Item | 25 to 45 business days | 8 to 14 business days |
|---|---|---|
| First item | £ 27.53 | £ 32.74 |
Payment methods
Seller's business information
The Nile Group Pty Ltd
42 Apex Drive
Truganina, VIC Australia 3029
Terms of sale
We guarantee the condition of every book as it's described on the Abebooks web sites. If you're dissatisfied with your purchase (Incorrect Book/Not as Described/Damaged) or if the order hasn't arrived, you're eligible for a refund within 30 days of the estimated delivery date. If you've changed your mind about a book that you've ordered, please use the Ask bookseller a question link to contact us and we'll respond within 2 business days.
Right of withdrawal
If you are a consumer you can withdraw from the contract in accordance with the following. Consumer means any natural person who is acting for purposes which are outside his trade, business, craft or profession.
Information regarding the right of withdrawal
Statutory right to withdraw
You have the right to withdraw from this contract within 14 days without giving any reason.
The withdrawal period will expire after 14 days from the day on which you acquire, or a third party other than the carrier and indicated by you acquires, physical possession of the last good or the last lot or piece.
To exercise the right of withdrawal, electronically fill in and submit a clear statement on our website, under "My Purchases" in "My Account". We will communicate to you an acknowledgement of receipt of such a withdrawal on a durable medium (e.g. by e-mail) without delay.
To meet the withdrawal deadline, it is sufficient for you to send your communication concerning your exercise of the right of withdrawal before the withdrawal period has expired.
Effects of withdrawal
If you withdraw from this contract, we will reimburse to you all payments received from you, including the costs of delivery (except for the supplementary costs arising if you chose a type of delivery other than the least expensive type of standard delivery offered by us).
We may make a deduction from the reimbursement for loss in value of any goods supplied, if the loss is the result of unnecessary handling by you.
We will make the reimbursement without undue delay, and not later than 14 days after the day on which we are informed about your decision to withdraw from this contract.
We will make the reimbursement using the same means of payment as you used for the initial transaction, unless you have expressly agreed otherwise; in any event, you will not incur any fees as a result of such reimbursement.
We may withhold reimbursement until we have received the goods back, or you have supplied evidence of having sent back the goods, whichever is the earliest.
You shall send back the goods or hand them over to AussieBookSeller, Truganina, Victoria, Australia, without undue delay and in any event not later than 14 days from the day on which you communicate your withdrawal from this contract to us. The deadline is met if you send back the goods before the period of 14 days has expired. You will have to bear the direct cost of returning the goods. You are only liable for any diminished value of the goods resulting from the handling other than what is necessary to establish the nature, characteristics and functioning of the goods.
Exceptions to the right of withdrawal
The right of withdrawal does not apply to:
- The delivery of newspapers, journals or magazines with the exception of subscription contracts; and
- The supply of digital content which is not supplied on a tangible medium (e.g. on a CD or DVD) if you accepted when you placed your order that we could start to deliver it, and that you could not withdraw once delivery had started.
Shipping terms
Please note that titles are dispatched from our UK and NZ warehouse. Delivery times specified in shipping terms. Orders ship within 2 business days. Delivery to your door then takes 8-15 days.