Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

Check order status

Become part of a community of book lovers from all over the world and get access to a whole bunch of benefits. Create an account for free

Free delivery for purchases over 19 990 Ft

DPD courier 1 190 Ft Post 1 795 Ft Post 1 690 Ft Post 1 690 Ft GLS point 1 390 Ft FoxPost 1 190 Ft Packeta point 1 190 Ft DPD point 990 Ft GLS courier 1 790 Ft

Contact

How to shop

Help

My account

▸ Empty :-(

Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

Invitation to Fixed-Parameter Algorithms

Name: Invitation to Fixed-Parameter Algorithms
Brand: Oxford University Press
SKU: 04477263
Price: 56031 HUF
Availability: InStock
Author: Rolf Niedermeier
ISBN: 9780198566076

Rolf Niedermeier

Language

English

Book Hardback

Libristo code: 04477263

Publishers Oxford University Press, February 2006

This research-level text is an application-oriented introduction to the growing and highly topical a... Full description

Libristo code: 04477263

382 b

56 031 Ft

In stock at our supplier Shipping in 10-18 days

30-day return policy

Customers also purchased

Energie. Walter Gille

Paperback

5 435 Ft

Grandeur Et Decadence de la Guerre De Molinari-G

Paperback

9 600 Ft

Dialogue Entre La France, Le Monde Et Robert Owen Owen-R

Paperback

5 218 Ft

La Chanson de Roland Louis Vitet

Paperback

3 693 Ft

Cumplimiento fiscal en la fase de procedimiento de inspección:

Paperback

13 833 Ft

This research-level text is an application-oriented introduction to the growing and highly topical area of the development and analysis of efficient fixed-parameter algorithms for optimally solving computationally hard combinatorial problems. The book is divided into three parts: a broad introduction that provides the general philosophy and motivation; followed by coverage of algorithmic methods developed over the years in fixed-parameter algorithmics forming the core of the book; and a discussion of the essentials from parameterized hardness theory with a focus on W[1]-hardness which parallels NP-hardness, then stating some relations to polynomial-time approximation algorithms, and finishing up with a list of selected case studies to show the wide range of applicability of the presented methodology. Aimed at graduate and research mathematicians, programmers, algorithm designers, and computer scientists, the book introduces the basic techniques and results and provides a fresh view on this highly innovative field of algorithmic research.