Parameterized and Exact Computation, Marek Cygan; Pinar Heggernes

Автор: Jianer Chen; Fedor V. Fomin
Название: Parameterized and Exact Computation
ISBN: 3642112684 ISBN-13(EAN): 9783642112683
Издательство: Springer
Рейтинг:
Цена: 10480.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: 4th International Workshop IWPEC 2009 Copenhagen Denmark September 1011 2009 Revised Selected Paper. .

Автор: Marek Cygan; Fedor V. Fomin; ?ukasz Kowalik; Danie
Название: Parameterized Algorithms
ISBN: 3319212745 ISBN-13(EAN): 9783319212746
Издательство: Springer
Рейтинг:
Цена: 9083.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Part III presents complexity results and lower bounds, giving negative evidence by way of W[1]-hardness, the Exponential Time Hypothesis, and kernelization lower bounds.All the results and concepts are introduced at a level accessible to graduate students and advanced undergraduate students.

Автор: Rodney G. Downey; M.R. Fellows
Название: Parameterized Complexity
ISBN: 1461267986 ISBN-13(EAN): 9781461267980
Издательство: Springer
Рейтинг:
Цена: 34937.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: An approach to complexity theory which offers a means of analysing algorithms in terms of their tractability. The authors consider the problem in terms of parameterized languages and taking "k-slices" of the language, thus introducing readers to new classes of algorithms which may be analysed more precisely than was the case until now.

Автор: Martin Grohe; Rolf Niedermeier
Название: Parameterized and Exact Computation
ISBN: 354079722X ISBN-13(EAN): 9783540797227
Издательство: Springer
Рейтинг:
Цена: 9083.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Constitutes the refereed proceedings of the Third International Workshop on Parameterized and Exact Computation, IWPEC 2008, held in Victoria, Canada, in May 2008 - co-located with the 40th ACM Symposium on Theory of Computing, STOC 2008.

Автор: Rodney G. Downey; M.R. Fellows
Название: Parameterized Complexity
ISBN: 038794883X ISBN-13(EAN): 9780387948836
Издательство: Springer
Рейтинг:
Цена: 27251.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: An approach to complexity theory which offers a means of analysing algorithms in terms of their tractability. The authors consider the problem in terms of parameterized languages and taking "k-slices" of the language, thus introducing readers to new classes of algorithms which may be analysed more precisely than was the case until now.

Автор: Gregory Gutin; Stefan Szeider
Название: Parameterized and Exact Computation
ISBN: 3319038974 ISBN-13(EAN): 9783319038971
Издательство: Springer
Рейтинг:
Цена: 6986.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание:

Exact Complexity and Satisfiability.- The Parameterized Complexity of Fixpoint Free Elements and Bases in Permutation Groups.- Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints.- Declarative Dynamic Programming as an Alternative Realization of Courcelle's Theorem.- The Fine Details of Fast Dynamic Programming over Tree Decompositions.- On Subexponential and FPT-Time Inapproximability.- Multi-parameter Complexity Analysis for Constrained Size Graph Problems: Using Greediness for Parameterization.- Chain Minors Are FPT.- Incompressibility of H-Free Edge Modification.- Contracting Few Edges to Remove Forbidden Induced Subgraphs.- Fixed-Parameter and Approximation Algorithms: A New Look.- Subgraphs Satisfying MSO Properties on z-Topologically Orderable Digraphs.- Computing Tree-Depth Faster Than 2n.- Faster Exact Algorithms for Some Terminal Set Problems.- Parameterized Algorithms for Modular-Width.- A Faster FPT Algorithm for Bipartite Contraction.- On the Ordered List Subgraph Embedding Problems.- A Completeness Theory for Polynomial (Turing) Kernelization.- On Sparsification for Computing Treewidth.- The Jump Number Problem: Exact and Parameterized.- On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges.- Hardness of r-dominating set on Graphs of Diameter (r + 1).- Amalgam Width of Matroids.- On the Parameterized Complexity of Reconfiguration Problems.- FPT Algorithms for Consecutive Ones Submatrix Problems.- Upper Bounds on Boolean-Width with Applications to Exact Algorithms.- Speeding Up Dynamic Programming with Representative Sets: An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions.- Completeness Results for Parameterized Space Classes.- Treewidth and Pure Nash Equilibria.- Algorithms for k-Internal Out-Branching.

Автор: Marek Cygan; Fedor V. Fomin; ?ukasz Kowalik; Danie
Название: Parameterized Algorithms
ISBN: 3319357026 ISBN-13(EAN): 9783319357027
Издательство: Springer
Рейтинг:
Цена: 9083.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Part III presents complexity results and lower bounds, giving negative evidence by way of W[1]-hardness, the Exponential Time Hypothesis, and kernelization lower bounds.All the results and concepts are introduced at a level accessible to graduate students and advanced undergraduate students.