Let us wish you a happy birthday!
Date of Birth
Please fill in a complete birthday Enter a valid birthday
×
This item is currently out of stock
Parameterized Algorithms
Be the first to rate this product 
×
Check Products in stock Products in stock

Sponsored products for you

PRODUCT INFORMATION

  •  

    Specifications

    Category Type
    Computer Sciences
    ISBN
    9783319212746.0
    Item EAN
    2724330359727
    People
    Author
    Marek Cygan
    People
    Publisher
    Springer
    Category Type
    Computer Sciences
    ISBN
    9783319212746.0
    Item EAN
    2724330359727
    People
    Author
    Marek Cygan
    People
    Publisher
    Springer
    Languages and countries
    Book Language
    English
    Read more
  •  

    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

    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 presents complexity 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.

 

Customer Reviews

0
No ratings yet
Be the first to rate this product
Rate this product:

×

Please verify your mobile number to complete your checkout

We will send you an SMS containing a verification code. Please double check your mobile number and click on "Send Verification Code".

+ Edit