Approximation Algorithms

Vijay V. Vazirani

57 ratings by Goodreads

Language: English

Published by Springer-Verlag Berlin and Heidelberg GmbH and Co. KG, DE, 2010

3642084699 / 9783642084690

  • Softcover
  • New
See all details

Seller: Rarewaves.com USA, London, London, United KingdomRarewaves.com USA

5-star seller

AbeBooks seller since June 11, 2025

Softcover

Condition: New

£ 63.73

 Free Shipping 
Ships from United Kingdom to U.S.A.

Quantity: Over 20 available

Add to basket
Free 30-day returns

Item description from seller

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. Softcover reprint of hardcover 1st ed. 2001.…

Seller Inventory # LU-9783642084690

Title
Approximation Algorithms
Author
Vijay V. Vazirani
Publisher
Springer-Verlag Berlin and Heidelberg GmbH and Co. KG, DE
Publication year
2010
Condition
New
Binding
Paperback
Language
English
ISBN 10
3642084699
ISBN 13
9783642084690

Rarewaves.com USA

London, London, United Kingdom

5-star seller

AbeBooks seller since June 11, 2025

Shipping rates from United Kingdom to U.S.A.

Item9 to 14 business days9 to 14 business days
First item£ 0.00£ 0.00
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

RAREWAVES.COM LIMITED

Elsley Court, 20-22 Great Titchfield Street
London, United Kingdom W1W 8BE