Approximation Algorithms (Hardcover)

Vijay V. Vazirani

57 ratings by Goodreads

Language: English

Published by Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Berlin, 2001

3540653678 / 9783540653677

  • First Edition
  • Hardcover
  • New
See all details

Seller: AussieBookSeller, Truganina, VIC, AustraliaAussieBookSeller

5-star seller

AbeBooks seller since June 22, 2007

Hardcover

Condition: New

£ 130.79

£ 27.53 shipping 
Ships from Australia to U.S.A.

Quantity: 1 available

Add to basket
Free 30-day returns

Item description from seller

Hardcover. 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 BerkeleyFollowing 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.Laszlo Lovasz, Senior Researcher, Microsoft Research 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 # 9783540653677

Title
Approximation Algorithms (Hardcover)
Author
Vijay V. Vazirani
Publisher
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Berlin
Publication year
2001
Condition
new
Binding
Hardcover
Language
English
ISBN 10
3540653678
ISBN 13
9783540653677
Edition
1st Edition

AussieBookSeller

Truganina, VIC, Australia

5-star seller

AbeBooks seller since June 22, 2007

Shipping rates from Australia to U.S.A.

Item25 to 45 business days8 to 14 business days
First item£ 27.53£ 32.74
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.

Payment methods

  • Visa
  • Mastercard
  • American Express
  • Apple Pay
  • Google Pay

Seller's business information

The Nile Group Pty Ltd

42 Apex Drive
Truganina, VIC Australia 3029