Rolf Niedermeier - Böcker
Visar alla böcker från författaren Rolf Niedermeier. Handla med fri frakt och snabb leverans.
2 produkter
2 produkter
Del 31 - Oxford Lecture Series in Mathematics and Its Applications
Invitation to Fixed-Parameter Algorithms
Inbunden, Engelska, 2006
1 801 kr
Skickas inom 5-8 vardagar
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.
Parameterized and Exact Computation
Third International Workshop, IWPEC 2008, Victoria, Canada, May 14-16, 2008, Proceedings
Häftad, Engelska, 2008
554 kr
Skickas inom 10-15 vardagar
This book constitutes the refereed proceedings of the Third International Workshop on Parameterized and Exact Computation, IWPEC 2008, held in Victoria, Canada, in May 2008 - co-located with the 40th ACM Symposium on Theory of Computing, STOC 2008. The 17 revised full papers presented together with 3 invited lectures were carefully reviewed and selected from 32 submissions. The topics addressed cover research in all aspects of parameterized and exact computation and complexity, including but not limited to new techniques for the design and analysis of parameterized and exact algorithms, parameterized complexity theory, relationship between parameterized complexity and traditional complexity classifications, applications of parameterized computation, implementation and experiments, high-performance computing and fixed-parameter tractability.