參數(shù)化與精確計(jì)算

定　價(jià)：￥508.50

作　者：	Hans L. Bodlaender，Michael A. Langston 著
出版社：	崇文書局（原湖北辭書出版社）
叢編項(xiàng)：
標(biāo)　簽：	暫缺

購(gòu)買這本書可以去

當(dāng)當(dāng)網(wǎng) (￥401.70)

ISBN：	9783540390985	出版時(shí)間：	2006-12-01	包裝：	平裝
開本：		頁(yè)數(shù)：		字?jǐn)?shù)：

內(nèi)容簡(jiǎn)介

　　This book constitutes the refereed proceedings of the Second International Workshop on Parameterized and Exact Computation， IWPEC 2006， held in Zurich， Switzerland， in September 2006 in the context of the combined conference ALGO 2006.The 23 revised full papers presented together with 2 invited lectures were carefully reviewed and selected from numerous 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， relationships between parameterized complexity and traditional complexity， applications of parameterized and exact computation， implementation issues and high-performance computing.

作者簡(jiǎn)介

暫缺《參數(shù)化與精確計(jì)算》作者簡(jiǎn)介

圖書目錄

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 Problelns 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θ (1.7548n)
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
……
Author Index