Approximation Algorithms
Vijay V. Vazirani
Sold by AHA-BUCH GmbH, Einbeck, Germany
AbeBooks Seller since 14 August 2006
New - Soft cover
Condition: New
Ships from Germany to U.S.A.
Quantity: 1 available
Add to basketSold by AHA-BUCH GmbH, Einbeck, Germany
AbeBooks Seller since 14 August 2006
Condition: New
Quantity: 1 available
Add to basketDruck auf Anfrage Neuware - Printed after ordering - 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.
Seller Inventory # 9783642084690
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.
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 this title" may belong to another edition of this title.
General Terms and Conditions and Customer Information / Privacy Policy
I. General Terms and Conditions
§ 1 Basic provisions
(1) The following terms and conditions apply to all contracts that you conclude with us as a provider (AHA-BUCH GmbH) via the Internet platforms AbeBooks and/or ZVAB. Unless otherwise agreed, the inclusion of any of your own terms and conditions used by you will be objected to
(2) A consumer within the meaning of the following regulations is any natural person who concludes...
**Right of withdrawal for consumers **
(A consumer is any natural person who concludes a legal transaction for purposes that can predominantly be attributed neither to their commercial nor their independent professional activity.)
Cancellation
Withdrawal
You have the right to revoke this contract within fourteen days without giving reasons.
The revocation period is fourteen days from the day,
on which you or a third party named by you, who is not the carrier, has taken possession of the goods, provided that you have ordered one or more goods within the framework of a uniform order and these are or will be delivered uniformly;
on which you or a third party named by you, who is not the carrier, has taken possession of the last goods, provided that you have ordered several goods within the framework of a single order and these are delivered separately;
on which you or a third party named by you, who is not the carrier, has taken possession of the last partial shipment or the last piece, provided that you have ordered goods that are delivered in several partial shipments or pieces;
In order to exercise your right of withdrawal, you must inform us (AHA-BUCH GmbH, Garlebsen 48, 37574 Einbeck, telephone number: 05563 9996039, fax number: 05563 9995974, e-mail address: service@aha-buch.de) of your decision to revoke this contract by means of a clear declaration (e.B. a letter sent by post, fax or e-mail). You can use the attached model withdrawal form, but this is not mandatory.
To comply with the revocation period, it is sufficient that you send the notification of the exercise of the right of revocation before the expiry of the revocation period.
Consequences of revocation
If you withdraw from this contract, we shall reimburse you all payments that we have received from you, including delivery costs (with the exception of the additional costs resulting from the fact that you have chosen a different type of delivery than the cheapest standard delivery offered by us), immediately and at the latest within fourteen days from the day on which we received the notification of your revocation of this contract.
For this repayment, we will use the same means of payment that you used for the original transaction, unless expressly agreed otherwise with you; in no case will you be charged any fees for this repayment.
We may withhold reimbursement until we have received the goods back or until you have provided proof that you have returned the goods, whichever is the earlier.
You must return or hand over the goods to us immediately and in any case at the latest within fourteen days from the day on which you inform us of the revocation of this contract. The deadline is met if you send the goods before the expiry of the period of fourteen days.
You bear the direct costs of returning the goods.
You only have to pay for any loss of value of the goods if this loss of value is due to handling of the goods that is not necessary to check the nature, characteristics and functioning of the goods.
Reasons for exclusion or extinction
The right of revocation does not apply to contracts
The right of revocation expires prematurely in the case of contracts
Sample withdrawal form
(If you want to cancel the contract, please fill out this form and send it back.)
To AHA-BUCH GmbH, Garlebsen 48, 37574 Einbeck, fax number: 05563 9995974, e-mail address: service@aha-buch.de :
I/we () hereby revoke the contract concluded by me/us () for the purchase of the following goods ()/
the provision of the following service ()
Ordered on ()/ received on ()
Name of the consumer(s)
Address of the consumer(s)
Signature of the consumer(s) (only in case of notification on paper)
Date
(*) Delete as appropriate.
We ship your order after we received them
for articles on hand latest 24 hours,
for articles with overnight supply latest 48 hours.
In case we need to order an article from our supplier our dispatch time depends on the reception date of the articles, but the articles will be shipped on the same day.
Our goal is to send the ordered articles in the fastest, but also most efficient and secure way to our customers.
| Order quantity | 30 to 40 business days | 7 to 14 business days |
|---|---|---|
| First item | £ 54.39 | £ 63.02 |
Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.