Coverart for item
The Resource Parameterized and exact computation : second international workshop, IWPEC 2006, Zürich, Switzerland, September 13-15, 2006 : proceedings, Hans L. Bodlaender, Michael A. Langston (eds.)

Parameterized and exact computation : second international workshop, IWPEC 2006, Zürich, Switzerland, September 13-15, 2006 : proceedings, Hans L. Bodlaender, Michael A. Langston (eds.)

Label
Parameterized and exact computation : second international workshop, IWPEC 2006, Zürich, Switzerland, September 13-15, 2006 : proceedings
Title
Parameterized and exact computation
Title remainder
second international workshop, IWPEC 2006, Zürich, Switzerland, September 13-15, 2006 : proceedings
Statement of responsibility
Hans L. Bodlaender, Michael A. Langston (eds.)
Title variation
IWPEC 2006
Creator
Contributor
Subject
Genre
Language
eng
Member of
Cataloging source
GW5XE
Dewey number
519.5/44
Illustrations
illustrations
Index
index present
LC call number
QA267.8
LC item number
.I96 2006eb
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
2006
http://bibfra.me/vocab/lite/meetingName
IWPEC (Workshop)
Nature of contents
  • dictionaries
  • bibliography
http://library.link/vocab/relatedWorkOrContributorDate
1950-
http://library.link/vocab/relatedWorkOrContributorName
  • Bodlaender, H. L
  • Langston, Michael A.
Series statement
  • Lecture notes in computer science.
  • LNCS sublibrary. SL 1, Theoretical computer science and general issues
Series volume
4169
http://library.link/vocab/subjectName
  • Parameter estimation
  • Computer algorithms
  • Computational complexity
Label
Parameterized and exact computation : second international workshop, IWPEC 2006, Zürich, Switzerland, September 13-15, 2006 : proceedings, Hans L. Bodlaender, Michael A. Langston (eds.)
Instantiates
Publication
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
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
Dimensions
unknown
Extent
1 online resource (xi, 277 pages)
Form of item
online
Isbn
9783540391012
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other physical details
illustrations.
Specific material designation
remote
System control number
  • SPR262693863
  • ocn262693863
Label
Parameterized and exact computation : second international workshop, IWPEC 2006, Zürich, Switzerland, September 13-15, 2006 : proceedings, Hans L. Bodlaender, Michael A. Langston (eds.)
Publication
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
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
Dimensions
unknown
Extent
1 online resource (xi, 277 pages)
Form of item
online
Isbn
9783540391012
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other physical details
illustrations.
Specific material designation
remote
System control number
  • SPR262693863
  • ocn262693863

Library Locations

Processing Feedback ...