£48.91

Springer Approximation Algorithms

Price data last checked 134 day(s) ago - refreshing...

View at Amazon

We'll watch every seller, every day. One email when your price arrives.

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

£49 today · usual range £0–£0 · best ever £43

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 597 days • 597 data points (No recent data available)

Historical
Generating forecast...
£49.99 £42.43 £44.08 £45.73 £47.38 £49.03 £50.68 09 June 2024 05 November 2024 03 April 2025 30 August 2025 26 January 2026

Price Distribution

Price distribution over 597 days • 5 price ranges

Days at Price
Current Price
103 days 115 days 270 days 49 days 60 days · current 0 68 135 203 270 £43-44 £44-46 £46-47 £47-49 £49-50 Days at Price

Price Analysis

Most common range: £46-47 (270 days, 45.2%)

Price range: £43 - £50

Price levels: 5 price ranges over 597 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.

Product Specifications

Format
paperback
Domain
Amazon UK
Release Date
08 December 2010
Listed Since
14 June 2010

Barcode

No barcode data available

Similar Products You Might Like

Approximation Algorithms
99% match

Approximation Algorithms

Springer

£63.80 09 Dec 2025
The Design of Approximation Algorithms
97% match

The Design of Approximation Algorithms

Cambridge University Press

£54.99 24 Jan 2026
Design and Analysis of Approximation Algorithms: 62 (Springer Optimization and Its Applications, 62)
97% match

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

Springer

£41.24 04 Mar 2026
Parameterized Algorithms
96% match

Parameterized Algorithms

Springer

£55.84 08 Mar 2026
Parameterized Algorithms
96% match

Parameterized Algorithms

Springer

£39.15 15 Feb 2026
Hybrid Metaheuristics: Powerful Tools for Optimization (Artificial Intelligence: Foundations, Theory, and Algorithms)
96% match

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

Springer

£91.82 19 Apr 2026
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)
96% match

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)

Springer

£109.72 18 Feb 2026
Applied Integer Programming: Modeling and Solution
96% match

Applied Integer Programming: Modeling and Solution

Wiley

£102.68 14 Jan 2026
Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems: 42 (Nonconvex Optimization and Its Applications, 42)
96% match

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

Springer

£165.17 13 Apr 2026
Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems: 42 (Nonconvex Optimization and Its Applications, 42)
96% match

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

Springer

£144.34 12 Jan 2026
Handbook of Approximation Algorithms and Metaheuristics: Contemporary and Emerging Applications, Volume 2 (Chapman & Hall/CRC Computer and Information Science Series)
96% match

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

CRC Press

£202.40 25 Jan 2026
Handbook of Approximation Algorithms and Metaheuristics, Second Edition: Two-Volume Set (Chapman & Hall/CRC Computer and Information Science Series)
96% match

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

CRC Press

£70.36 16 Feb 2026
Integer Programming and Combinatorial Optimization: 11th International IPCO Conference, Berlin, Germany, June 8-10, 2005, Proceedings: 3509 (Lecture Notes in Computer Science, 3509)
96% match

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

Springer

£64.66 25 Feb 2026
Integer Programming and Network Models
96% match

Integer Programming and Network Models

Springer

£120.77 08 Mar 2026
Integer Programming and Network Models
96% match

Integer Programming and Network Models

Springer

£116.81 08 Jan 2026
Complexity and Approximation: In Memory of Ker-I Ko: 12000 (Lecture Notes in Computer Science, 12000)
95% match

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

Springer

£51.14 12 Mar 2026
Dynamic Programming Multi-Objective Combinatorial Optimization: 331 (Studies in Systems, Decision and Control, 331)
95% match

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

Springer

£121.12 09 Mar 2026
Linear and Integer Optimization: Theory and Practice, Third Edition (Advances in Applied Mathematics)
95% match

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

CRC Press

£63.71 08 Mar 2026
Dynamic Programming Multi-Objective Combinatorial Optimization: 331 (Studies in Systems, Decision and Control, 331)
95% match

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

Springer

£109.82 08 Mar 2026
Integer Programming: Theory and Practice (Operations Research)
95% match

Integer Programming: Theory and Practice (Operations Research)

CRC Press

£155.00 30 Jan 2026
Techniques for Designing and Analyzing Algorithms (Chapman & Hall/CRC Cryptography and Network Security Series)
95% match

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

£82.49 24 Jan 2026
Local Search in Combinatorial Optimization
95% match

Local Search in Combinatorial Optimization

Princeton University Press

£53.31 26 Feb 2026
Mathematics of Optimization: How to Do Things Faster (Pure and Applied Undergraduate Texts)
95% match

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

£60.95 16 Feb 2026
Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial Optimization and Neural Computing: 21 (Wiley Series in Discrete Mathematics & Optimization)
95% match

Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial Optimization and Neural Computing: 21 (Wiley Series in Discrete Mathematics & Optimization)

Wiley

£128.79 12 Jan 2026