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.
"synopsis" may belong to another edition of this title.
You will enjoy reading it whether you want to do research in the area or just want to learn about it. And while merily intending the latter, you are most likely going to end up doing the former when you finish reading it. (EMS Newsletter)
This book is an excellent introduction to the algorithmic aspects of the field (William Gasarch and Kin Keung Ma, The Computer Journal, Vol. 51 No. 1)
Niedermeier presents a wider range of concrete problems and pronlem variants, highlighting many algorithmic tricks and applications. (Daniel Marx, Mathematical Review)
The book is certainly value for money and I would highly recommend it as an essential purchase for a university library. (Journal of the Operational Research Society)
"About this title" may belong to another edition of this title.
Seller: Recycle Bookstore, San Jose, CA, U.S.A.
Hardcover. Condition: Very Good. There is light shelf wear & rubbing on the cloth, with a modest cock to the spine resulting in slight bowing of the covers & pages, a small light blue stamp on the top of the text block, light smudging on the top & bottom of the text block, bent upper corners on pages 77 & 79, & wear on the lower portion of the outer edge of page 81; the book is attractive & otherwise in very good condition. Reprint. Seller Inventory # 937775
Seller: Anybook.com, Lincoln, United Kingdom
Condition: Good. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. In good all round condition. No dust jacket. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,700grams, ISBN:9780198566076. Seller Inventory # 5806542
Quantity: 1 available
Seller: Anybook.com, Lincoln, United Kingdom
Condition: Good. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. In good all round condition. No dust jacket. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,650grams, ISBN:9780198566076. Seller Inventory # 5832975
Quantity: 1 available
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
HRD. Condition: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Seller Inventory # L1-9780198566076
Quantity: Over 20 available
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Condition: New. In. Seller Inventory # ria9780198566076_new
Quantity: Over 20 available
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New. Seller Inventory # 4023890-n
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
HRD. Condition: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Seller Inventory # L1-9780198566076
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: New. Seller Inventory # 4023890-n
Quantity: Over 20 available
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: As New. Unread book in perfect condition. Seller Inventory # 4023890
Seller: AussieBookSeller, Truganina, VIC, Australia
Hardcover. Condition: new. Hardcover. 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-parameteralgorithmics 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 topolynomial-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. An application-oriented introduction to the highly topical area of the development and analysis of efficient fixed-parameter algorithms for hard problems. Aimed at graduate and research mathematicians, algorithm designers, and computer scientists, it provides a fresh view on this highly innovative field of algorithmic research. This item is printed on demand. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability. Seller Inventory # 9780198566076
Quantity: 1 available