Invitation to Fixed-Parameter Algorithms
Oxford University Press (2006)
| Abstract | A fixed-parameter is an algorithm that provides an optimal solution to a combinatorial problem. 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 hard 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 essential 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. | |||||||||
| Keywords | Algorithms Combinatorial analysis Parameter estimation | |||||||||
| Categories | ||||||||||
| Buy the book | $107.29 direct from Amazon (24% off) Amazon page | |||||||||
| Call number | QA9.58.N54 2006 | |||||||||
| ISBN(s) | 0198566077 9780198566076 | |||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,631 |
| External links |
  Try with proxy. |
| Through your library | Configure |
Similar books and articlesVladimir V. Rybakov (2011). Best Unifiers in Transitive Modal Logics. Studia Logica 99 (1-3):321-336.
Donald Ervin Knuth (2010). Selected Papers on Design of Algorithms. Center for the Study of Language and Information.
Martin Peterson (2011). Is There an Ethics of Algorithms? Ethics and Information Technology 13 (3):251-260.
Ljiljana Brankovic, Yuqing Lin & Bill Smyth (eds.) (2008). Proceedings of the International Workshop on Combinatorial Algorithms, 2007. College Publications.
Ljiljana Brankovic, Yuqing Lin & Bill Smyth (eds.) (2008). Proceedings of the International Workshop on Combinatorial Algorithms, 2007. College Publications.
Thomas Bartz-Beielstein (2008). How Experimental Algorithmics Can Benefit From Mayo's Extensions to Neyman–Pearson Theory of Testing. Synthese 163 (3):385 - 396.
Ivan Stojmenović (1987). Some Combinatorial and Algorithmic Problems in Many-Valued Logics. University of Novi Sad, Faculty of Science, Institute of Mathematics.
Jeff Edmonds (2008). How to Think About Algorithms. Cambridge University Press.
Analytics
Monthly downloads |
Added to index2009-01-28Total downloads2 ( #232,211 of 548,969 )Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
