000 05633nam a22005895i 4500
001 978-3-540-39101-2
003 DE-He213
005 20240730193224.0
007 cr nn 008mamaa
008 100301s2006 gw | s |||| 0|eng d
020 _a9783540391012
_9978-3-540-39101-2
024 7 _a10.1007/11847250
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
072 7 _aUMB
_2thema
082 0 4 _a518.1
_223
245 1 0 _aParameterized and Exact Computation
_h[electronic resource] :
_bSecond International Workshop, IWPEC 2006, Zürich, Switzerland, September 13-15, 2006, Proceedings /
_cedited by Hans L. Bodlaender, Michael A. Langston.
250 _a1st ed. 2006.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2006.
300 _aXI, 279 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v4169
505 0 _aApplying 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.
520 _aThe 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.
650 0 _aAlgorithms.
_93390
650 0 _aComputer science.
_99832
650 0 _aArtificial intelligence
_xData processing.
_921787
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 1 4 _aAlgorithms.
_93390
650 2 4 _aTheory of Computation.
_9152921
650 2 4 _aData Science.
_934092
650 2 4 _aDiscrete Mathematics in Computer Science.
_931837
700 1 _aBodlaender, Hans L.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9152922
700 1 _aLangston, Michael A.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9152923
710 2 _aSpringerLink (Online service)
_9152924
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540390985
776 0 8 _iPrinted edition:
_z9783540828754
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v4169
_9152925
856 4 0 _uhttps://doi.org/10.1007/11847250
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c94655
_d94655