Parameterized and Exact Computation

Second International Workshop, IWPEC 2006, Zürich, Switzerland, September 13-15, 2006, Proceedings

Hans L. Bodlaender, Michael A. Langston (Herausgeber)

Buch | Softcover

XI, 279 Seiten

2006 | 2006
Springer Berlin (Verlag)
978-3-540-39098-5 (ISBN)

Artikel merken

The Second International Workshop on Parameterized and Exact Computation (IWPEC) was held in Zu ¨rich, Switzerland, during September 13-15, 2006. It th was organized as a component of ALGO 2006, which also hosted the 14 - th nual European Symposium on Algorithms, the 6 Workshop on Algorithms in th Bioinformatics, the 4 Workshop on Approximation and Online Algorithms, th and the 6 Workshop on Algorithmic Methods and Models for Optimization of Railways. This meeting was the second in the IWPEC series, with the ?rst having been held in Bergen, Norway, during September 14-16, 2004. The ?eld continues to experience rapid growth, in part due to its appeal as an alternative to tra- tional complexity theory, and in part due to the powerful practical applications it has spawned. IWPEC events are intended to cover research in all aspects of parameterizedand exact computation and complexity, including but not limited to new techniques for the design and analysis of parameterized and exact al- rithms, parameterized complexity theory, relationships between parameterized complexity and traditional complexity, applications of parameterized and exact computation, implementation issues and high-performance computing. A major goal is to disseminate the latest research results, including signi?cant work-- progress, and to identify, de?ne and explore directions for future study. The papers accepted for presentation and printed in these proceedings rep- sent a diverse spectrum of the latest developments on parameterized and exact algorithm design, analysis, application and implementation.

Applying Modular Decomposition to Parameterized Bicluster Editing.- The Cluster Editing Problem: Implementations and Experiments.- The Parameterized Complexity of Maximality and Minimality Problems.- Parameterizing MAX SNP Problems Above Guaranteed Values.- Randomized Approximations of Parameterized Counting Problems.- Fixed-Parameter Complexity of Minimum Profile Problems.- On the OBDD Size for Graphs of Bounded Tree- and Clique-Width.- Greedy Localization and Color-Coding: Improved Matching and Packing Algorithms.- Fixed-Parameter Approximation: Conceptual Framework and Approximability Results.- On Parameterized Approximability.- Parameterized Approximation Problems.- An Exact Algorithm for the Minimum Dominating Clique Problem.- edge dominating set: Efficient Enumeration-Based Exact Algorithms.- Parameterized Complexity of Independence and Domination on Geometric Graphs.- Fixed Parameter Tractability of Independent Set in Segment Intersection Graphs.- On the Parameterized Complexity of d-Dimensional Point Set Pattern Matching.- Finding a Minimum Feedback Vertex Set in Time .- The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel.- Fixed-Parameter Tractability Results for Full-Degree Spanning Tree and Its Dual.- On the Effective Enumerability of NP Problems.- The Parameterized Complexity of Enumerating Frequent Itemsets.- Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems.- Towards a Taxonomy of Techniques for Designing Parameterized Algorithms.- Kernels: Annotated, Proper and Induced.- The Lost Continent of Polynomial Time: Preprocessing and Kernelization.- FPT at Work: Using Fixed Parameter Tractability to Solve Larger Instances of Hard Problems.

Erscheint lt. Verlag	12.9.2006
Reihe/Serie	Lecture Notes in Computer Science
Reihe/Serie	Theoretical Computer Science and General Issues
Zusatzinfo	XI, 279 p.
Verlagsort	Berlin
Sprache	englisch
Maße	155 x 235 mm
Gewicht	450 g
Themenwelt	Informatik ► Theorie / Studium ► Algorithmen
Themenwelt	Mathematik / Informatik ► Mathematik ► Wahrscheinlichkeit / Kombinatorik
Schlagworte	Algorithm analysis and problem complexity • Algorithmics • algorithms • Algorithms Design • Approximation • combinatorial optimization • complexity analysis • Computational Complexity • Computational Discrete Mathematics • Computational Geometry • Computational Graph Theory • data structures • exact computation • geometric alg • geometric algorithms • Graph Algorithms • parameterized complexity • parameterized computation • problem complexity • Scheduling • Search algorithms
ISBN-10	3-540-39098-7 / 3540390987
ISBN-13	978-3-540-39098-5 / 9783540390985
Zustand	Neuware