£55.84

Springer Parameterized Algorithms

Name: Parameterized Algorithms
Brand: Springer
Price: 55.84 GBP
Availability: InStock

Algorithms

Same price for 8 weeks. Today is much like next week.

£56 for 57 days straight · last change was Jan 2026

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

Historical

Generating forecast...

Price Distribution

Price distribution over 638 days • 5 price ranges

Days at Price

Current Price

Price Analysis

Most common range: £53-56 (317 days, 49.7%)

Price range: £50 - £64

Price levels: 5 price ranges over 638 days

Description

This comprehensive textbook presents a clean and coherent account of most fundamental tools and techniques in Parameterized Algorithms and is a self-contained guide to the area. The book covers many of the recent developments of the field, including application of important separators, branching based on linear programming, Cut & Count to obtain faster algorithms on tree decompositions, algorithms based on representative families of matroids, and use of the Strong Exponential Time Hypothesis. A number of older results are revisited and explained in a modern and didactic way. The book provides a toolbox of algorithmic techniques. Part I is an overview of basic techniques, each chapter discussing a certain algorithmic paradigm. The material covered in this part can be used for an introductory course on fixed-parameter tractability. Part II discusses more advanced and specialized algorithmic ideas, bringing the reader to the cutting edge of current research. Part III presentscomplexity results and lower bounds, giving negative evidence by way of W[1]-hardness, the Exponential Time Hypothesis, and kernelization lower bounds. All the results and concepts are introduced at a level accessible to graduate students and advanced undergraduate students. Every chapter is accompanied by exercises, many with hints, while the bibliographic notes point to original publications and related work.

Product Specifications

Brand: Springer
Format: Hardcover
ASIN: 3319212745
Category: Books > Subjects > Computing & Internet > Programming > Algorithms
Domain: Amazon UK
Release Date: 03 August 2015
Listed Since: 03 June 2015

Barcode

No barcode data available

Springer Parameterized Algorithms

Same price for 8 weeks. Today is much like next week.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

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)

Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)

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

Approximation Algorithms

Approximation Algorithms

Fundamentals of Parameterized Complexity (Texts in Computer Science)

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

A Programmer's Companion to Algorithm Analysis

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

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

Parameterized and Exact Computation: 7th International Symposium, IPEC 2012, Ljubljana, Slovenia, September 12-14, 2012. Proceedings: 7535 (Lecture Notes in Computer Science, 7535)

Algorithms as a Basis of Modern Applied Mathematics: 404 (Studies in Fuzziness and Soft Computing, 404)

An Introduction To The Analysis Of Algorithms (3rd Edition)

Mathematics for the Analysis of Algorithms: v. 1 (Progress in Theoretical Computer Science)

Guide to Competitive Programming: Learning and Improving Algorithms Through Contests (Undergraduate Topics in Computer Science)

Algorithms - ESA '94: Second Annual European Symposium, Utrecht, The Netherlands, September 26 - 28, 1994. Proceedings: 855 (Lecture Notes in Computer Science, 855)

The Complexity Theory Companion (Texts in Theoretical Computer Science. An EATCS Series)

Algorithm Design: A Methodological Approach - 150 problems and detailed solutions

Algorithms and Theory of Computation Handbook, Volume 2: Special Topics and Techniques (Chapman & Hall/CRC Applied Algorithms and Data Structures series)

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

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

Algorithms for Smart World Technologies: A Comprehensive Guide to Applications in AI, IoT and Automation for Electrical and Computer Engineers