Parameterized and Exact Computation
Editat de Hans L. Bodlaender, Michael A. Langstonen Limba Engleză Paperback – 12 sep 2006
Preț: 321.94 lei
Preț vechi: 402.43 lei
-20%
Puncte Express: 483
Carte tipărită la comandă
Livrare economică 27 iulie-10 august
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 400.00 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9783540390985
ISBN-10: 3540390987
Pagini: 296
Ilustrații: XI, 279 p.
Dimensiuni: 155 x 235 x 17 mm
Greutate: 0.45 kg
Ediția:2006
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540390987
Pagini: 296
Ilustrații: XI, 279 p.
Dimensiuni: 155 x 235 x 17 mm
Greutate: 0.45 kg
Ediția:2006
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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.