Parameterized and Exact Computation Second International Workshop, IWPEC 2006, Zurich, Switzerland, September 13-15, 2006, Proceedings

Name: Parameterized and Exact Computation Second International Workshop, IWPEC 2006, Zurich, Switzerland, September 13-15, 2006, Proceedings
Availability: InStock
ISBN: 9783540390985

ISBN-10: 3540390987

ISBN-13: 9783540390985

Edition: 2006

Authors: Hans L. Bodlaender, Michael A. Langston

List price: $54.99

30 day, 100% satisfaction guarantee!

Rent eBooks

30 day rental: $16.50 Expiration date: 6/1/2024

60 day rental: $22.00 Expiration date: 7/1/2024

90 day rental: $27.50 Expiration date: 7/31/2024

120 day rental: $33.00 Expiration date: 8/30/2024

180 day rental: $35.75 Expiration date: 10/29/2024

Marketplace

2 new & used from $55.49

what's this?

Rush Rewards U
Members Receive:

You have reached 400 XP and carrot coins. That is the daily max!

Description:

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,…

Book details

List price: $54.99
Copyright year: 2006
Publisher: Springer Berlin / Heidelberg
Publication date: 9/12/2006
Binding: Paperback
Pages: 279
Size: 6.10" wide x 9.25" long x 0.27" tall
Weight: 1.012



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 O(1.7548[superscript n])



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 innumerability 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