1 option
Parameterized and Exact Computation : Second International Workshop, IWPEC 2006, Zürich, Switzerland, September 13-15, 2006, Proceedings / edited by Hans L. Bodlaender, Michael A. Langston.
SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024) Available online
View online- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- LNCS sublibrary. Theoretical computer science and general issues ; SL 1, 4169.
- Theoretical Computer Science and General Issues ; 4169
- Language:
- English
- Subjects (All):
- Algorithms.
- Computers.
- Data structures (Computer science).
- Computer science--Mathematics.
- Computer science.
- Algorithm Analysis and Problem Complexity.
- Computation by Abstract Devices.
- Data Structures.
- Discrete Mathematics in Computer Science.
- Local Subjects:
- Algorithm Analysis and Problem Complexity.
- Computation by Abstract Devices.
- Data Structures.
- Discrete Mathematics in Computer Science.
- Algorithms.
- Physical Description:
- 1 online resource (XI, 279 pages).
- Edition:
- First edition 2006.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2006.
- System Details:
- text file PDF
- Summary:
- 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.
- Contents:
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-39101-2
- 9783540391012
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.