## Parameterized Algorithms

Author: Marek Cygan

Publisher: Springer

ISBN:

Category: Computers

Page: 613

View: 402

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.

## Parameterized Algorithms on Digraph and Constraint Satisfaction Problems

Author: Eun Jung Kim

Publisher:

ISBN:

Category:

Page: 140

View: 972

While polynomial-time approximation algorithms remain a dominant notion in tackling computationally hard problems, the framework of parameterized complexity has been emerging rapidly in recent years. Roughly speaking, the analytic framework of parameterized complexity attempts to grasp the difference between problems which admit O(c k . poly(n))-time algorithms such as Vertex Cover, and problems like Dominating Set for which essentially brute-force O(n k)-algorithms are best possible until now. Problems of the former type is said to be fixed-parameter tractable (FPT) and those of the latter type are regarded intractable. In this thesis, we investigate some problems on directed graphs and a number of constraint satisfaction problems (CSPs) from the parameterized perspective. We develop fixed-parameter algorithms for some digraph problems. In particular, we focus on the basic problem of finding a tree with certain property embedded in a given digraph. New or improved fpt-algorthms are presented for finding an out-branching with many or few leaves (Directed Maximum Leaf, Directed Minimum Leaf problems). For acyclic digraphs, Directed Maximum Leaf is shown to allow a kernel with linear number of vertices. We suggest a kernel for Directed Minimum Leaf with quadratic number of vertices. An improved fpt-algorithm for finding k-Out-Tree is presented and this algorithm is incorporated as a subroutine to obtain a better algorithm for Directed Minimum Leaf. In the second part of this thesis, we concentrate on several CSPs in which we want to maximize the number of satisfied constraints and consider parameterization "above tight lower bound" for these problems. To deal with this type of parameterization, we present a new method called SABEM using probabilistic approach and applying harmonic analysis on pseudo-boolean functions. Using SABEM we show that a number of CSPs admit polynomial kernels, thus being fixed-parameter tractable. Moreover, we suggest some problem-specific combinatorial approaches to Max-2-Sat and a wide special class of Max-Lin2, which lead to a kernel of smaller size than what can be obtained using SABEM for respective problems.

## Parameterized and Exact Computation

Third International Workshop, IWPEC 2008, Victoria, Canada, May 14-16, 2008, Proceedings

Author: Martin Grohe

Publisher: Springer Science & Business Media

ISBN:

Category: Computers

Page: 227

View: 981

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.

## Algorithms -- ESA 2011

19th Annual European Symposium, Saarbrücken, Germany, September 5-9, 2011, Proceedings

Author: Camil Demetrescu

Publisher: Springer

ISBN:

Category: Computers

Page: 813

View: 420

This book constitutes the refereed proceedings of the 19th Annual European Symposium on Algorithms, ESA 2011, held in Saarbrücken, Germany, in September 2011 in the context of the combined conference ALGO 2011. The 67 revised full papers presented were carefully reviewed and selected from 255 initial submissions: 55 out of 209 in track design and analysis and 12 out of 46 in track engineering and applications. The papers are organized in topical sections on approximation algorithms, computational geometry, game theory, graph algorithms, stable matchings and auctions, optimization, online algorithms, exponential-time algorithms, parameterized algorithms, scheduling, data structures, graphs and games, distributed computing and networking, strings and sorting, as well as local search and set systems.

## Algorithms and Computation

19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings

Author: Seok-Hee Hong

Publisher: Springer Science & Business Media

ISBN:

Category: Computers

Page: 945

View: 616

This book constitutes the refereed proceedings of the 19th International Symposium on Algorithms and Computation, ISAAC 2008, held in Gold Coast, Australia in December 2008. The 78 revised full papers together with 3 invited talks presented were carefully reviewed and selected from 229 submissions for inclusion in the book. The papers are organized in topical sections on approximation algorithms, online algorithms, data structure and algorithms, game theory, graph algorithms, fixed parameter tractability, distributed algorithms, database, approximation algorithms, computational biology, computational geometry, complexity, networks, optimization as well as routing.

## Parameterized and Exact Computation

8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, Revised Selected Papers

Author: Gregory Gutin

Publisher: Springer

ISBN:

Category: Computers

Page: 375

View: 959

This book constitutes the thoroughly refereed post-conference proceedings of the 8th International Symposium on Parameterized and Exact Computation, IPEC 2013, in Sophia Antipolis, France, in September 2013. The 29 revised full papers presented were carefully reviewed and selected from 58 submissions. The topics addressed cover research in all aspects of parameterized/exact algorithms and complexity including but are not limited to new techniques for the design and analysis of parameterized and exact algorithms, fixed-parameter tractability results, parameterized complexity theory, relationship between parameterized complexity and traditional complexity classifications, applications of parameterized and exact computation, and implementation issues of parameterized and exact algorithms.

## Algorithms and Data Structures

Author: Frank Dehne

Publisher: Springer Science & Business Media

ISBN:

Category: Computers

Page: 446

View: 806

This book constitutes the refereed proceedings of the 9th International Workshop on Algorithms and Data Structures, WADS 2005, held in Waterloo, Canada, in August 2005. The 37 revised full papers presented were carefully reviewed and selected from 90 submissions. A broad variety of topics in algorithmics and data structures is addressed including searching and sorting, approximation, graph and network computations, computational geometry, randomization, communications, combinatorial optimization, scheduling, routing, navigation, coding, and pattern matching.

## Parameterized and Exact Computation

9th International Symposium, IPEC 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected Papers

Author: Marek Cygan

Publisher: Springer

ISBN:

Category: Computers

Page: 343

View: 941

This book constitutes the thoroughly refereed post-conference proceedings of the 9th International Symposium on Parameterized and Exact Computation, IPEC 2014, in Wroclaw, Poland, in September 2014. The 27 revised full papers presented together with one invited paper were carefully reviewed and selected from 42 submissions. The topics addressed cover research in all aspects of parameterized/exact algorithms and complexity including but are not limited to new techniques for the design and analysis of parameterized and exact algorithms, fixed-parameter tractability results; parameterized complexity theory, relationship between parameterized complexity and traditional complexity classifications; applications of parameterized and exact exponential-time computation; and implementation issues of parameterized and exact exponential-time algorithms.

## Parameterized and Exact Computation

5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings

Author: Venkatesh Raman

Publisher: Springer

ISBN:

Category: Computers

Page: 239

View: 159

Annotation. This book constitutes the refereed best selected papers of the 5th International Symposium on Parameterized and Exact Computation, IPEC 2010, held in Chennai, India, in December 2010. The 19 revised full papers presented 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 and exact computation; implementation issues of parameterized and exact algorithms; fixed-parameter approximation; fast approximation in exponential time; kernelization lower and upper bounds.

## Combinatorial Algorithms

22th International Workshop, IWOCA 2011, Victoria, Canada, July 20-22, 2011, Revised Selected Papers

Author: Costas S. Iliopoulos

Publisher: Springer Science & Business Media

ISBN:

Category: Computers

Page: 387

View: 608

With endocrinologists deploying nuclear medicine on a daily basis, and with the rapid development of the latter, this concise and up-to-date guide to the vital information required has been designed to maximize relevance and ease of use in clinical practice.