£63.80

Springer Approximation Algorithms

Name: Approximation Algorithms
Brand: Springer
Price: 63.8 GBP
Availability: InStock

Illustrations

E-Commerce

This is the usual price. Wait for it to drop, or tell us your number.

£64 today · usual range £0–£0 · best ever £51

NEW HERE?

Amazon shows you one price. We show you all of them.

Tosheroon watches Amazon prices so you don't have to. Every product on Amazon has a price history — we make it visible. Set the price you'd actually pay, and we'll email you the second it gets there. No app, no account, one email.

WHAT'S ON THIS PAGE

↓ Price chart
when this has been cheap or pricey

↓ Forecast
where the price is heading next

↓ Statistics
all-time high & low, recent range

↑ Price alert
name your number, we'll email you

Price History & Forecast

Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.

Last 549 days • 549 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 549 days • 9 price levels

Days at Price

Current Price

Price Analysis

Most common price: £65 (228 days, 41.5%)

Price range: £51 - £76

Price levels: 9 different prices over 549 days

Description

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.

Key Features

New

Mint Condition

Dispatch same day for order received before 12 noon

Guaranteed packaging

No quibbles returns

Product Specifications

Brand: Springer
Model: Illustrations
Format: hardcover
ASIN: 3540653678
Category: Books > Subjects > Business, Finance & Law > E-Commerce
Domain: Amazon UK
Release Date: 02 July 2001
Listed Since: 18 January 2007

Barcode

No barcode data available

Springer Approximation Algorithms

This is the usual price. Wait for it to drop, or tell us your number.

Price History & Forecast

Price Distribution

Price Analysis

Description

Key Features

Product Specifications

Barcode

Similar Products You Might Like

Approximation Algorithms

The Design of Approximation Algorithms

Design and Analysis of Approximation Algorithms: 62 (Springer Optimization and Its Applications, 62)

Parameterized Algorithms

Parameterized Algorithms

Approximation and Online Algorithms: 18th International Workshop, WAOA 2020, Virtual Event, September 9–10, 2020, Revised Selected Papers: 12806 (Lecture Notes in Computer Science, 12806)

Hybrid Metaheuristics: Powerful Tools for Optimization (Artificial Intelligence: Foundations, Theory, and Algorithms)

Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems: 42 (Nonconvex Optimization and Its Applications, 42)

Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems: 42 (Nonconvex Optimization and Its Applications, 42)

Applied Integer Programming: Modeling and Solution

Handbook of Approximation Algorithms and Metaheuristics: Contemporary and Emerging Applications, Volume 2 (Chapman & Hall/CRC Computer and Information Science Series)

Handbook of Approximation Algorithms and Metaheuristics, Second Edition: Two-Volume Set (Chapman & Hall/CRC Computer and Information Science Series)

Integer Programming and Combinatorial Optimization: 11th International IPCO Conference, Berlin, Germany, June 8-10, 2005, Proceedings: 3509 (Lecture Notes in Computer Science, 3509)

Complexity and Approximation: In Memory of Ker-I Ko: 12000 (Lecture Notes in Computer Science, 12000)

Integer Programming and Network Models

Integer Programming and Network Models

Linear and Integer Optimization: Theory and Practice, Third Edition (Advances in Applied Mathematics)

Dynamic Programming Multi-Objective Combinatorial Optimization: 331 (Studies in Systems, Decision and Control, 331)

Integer Programming: Theory and Practice (Operations Research)

Dynamic Programming Multi-Objective Combinatorial Optimization: 331 (Studies in Systems, Decision and Control, 331)

Techniques for Designing and Analyzing Algorithms (Chapman & Hall/CRC Cryptography and Network Security Series)

Local Search in Combinatorial Optimization

Mathematics of Optimization: How to Do Things Faster (Pure and Applied Undergraduate Texts)

Advances In Combinatorial Optimization: Linear Programming Formulations Of The Traveling Salesman And Other Hard Combinatorial Optimization Problems