Parameterized Algorithms (Record no. 56634)
[ view plain ]
000 -LEADER | |
---|---|
fixed length control field | 03683nam a22005175i 4500 |
001 - CONTROL NUMBER | |
control field | 978-3-319-21275-3 |
005 - DATE AND TIME OF LATEST TRANSACTION | |
control field | 20200421112041.0 |
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
fixed length control field | 150720s2015 gw | s |||| 0|eng d |
020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
ISBN | 9783319212753 |
-- | 978-3-319-21275-3 |
082 04 - CLASSIFICATION NUMBER | |
Call Number | 005.1 |
100 1# - AUTHOR NAME | |
Author | Cygan, Marek. |
245 10 - TITLE STATEMENT | |
Title | Parameterized Algorithms |
300 ## - PHYSICAL DESCRIPTION | |
Number of Pages | XVII, 613 p. 84 illus., 25 illus. in color. |
505 0# - FORMATTED CONTENTS NOTE | |
Remark 2 | Introduction -- Kernelization -- Bounded Search Trees -- Iterative Compression -- Randomized Methods in Parameterized Algorithms -- Miscellaneous -- Treewidth -- Finding Cuts and Separators -- Advanced Kernelization Algorithms -- Algebraic Techniques: Sieves, Convolutions, and Polynomials -- Improving Dynamic Programming on Tree Decompositions -- Matroids -- Fixed-Parameter Intractability -- Lower Bounds Based on the Exponential-Time Hypothesis -- Lower Bounds for Kernelization. |
520 ## - SUMMARY, ETC. | |
Summary, etc | This comprehensive textbook presents a clean and coherent account of most fundamental tools and techniques in Parameterized Algorithms and is a self-contained guide to the area. The book covers many of the recent developments of the field, including application of important separators, branching based on linear programming, Cut & Count to obtain faster algorithms on tree decompositions, algorithms based on representative families of matroids, and use of the Strong Exponential Time Hypothesis. A number of older results are revisited and explained in a modern and didactic way. The book provides a toolbox of algorithmic techniques. Part I is an overview of basic techniques, each chapter discussing a certain algorithmic paradigm. The material covered in this part can be used for an introductory course on fixed-parameter tractability. Part II discusses more advanced and specialized algorithmic ideas, bringing the reader to the cutting edge of current research. 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. Every chapter is accompanied by exercises, many with hints, while the bibliographic notes point to original publications and related work. |
700 1# - AUTHOR 2 | |
Author 2 | Fomin, Fedor V. |
700 1# - AUTHOR 2 | |
Author 2 | Kowalik, �ukasz. |
700 1# - AUTHOR 2 | |
Author 2 | Lokshtanov, Daniel. |
700 1# - AUTHOR 2 | |
Author 2 | Marx, D�aniel. |
700 1# - AUTHOR 2 | |
Author 2 | Pilipczuk, Marcin. |
700 1# - AUTHOR 2 | |
Author 2 | Pilipczuk, Micha�. |
700 1# - AUTHOR 2 | |
Author 2 | Saurabh, Saket. |
856 40 - ELECTRONIC LOCATION AND ACCESS | |
Uniform Resource Identifier | http://dx.doi.org/10.1007/978-3-319-21275-3 |
942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
Koha item type | eBooks |
264 #1 - | |
-- | Cham : |
-- | Springer International Publishing : |
-- | Imprint: Springer, |
-- | 2015. |
336 ## - | |
-- | text |
-- | txt |
-- | rdacontent |
337 ## - | |
-- | computer |
-- | c |
-- | rdamedia |
338 ## - | |
-- | online resource |
-- | cr |
-- | rdacarrier |
347 ## - | |
-- | text file |
-- | |
-- | rda |
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
-- | Computer science. |
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
-- | Algorithms. |
650 14 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
-- | Computer Science. |
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
-- | Algorithm Analysis and Problem Complexity. |
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
-- | Algorithms. |
912 ## - | |
-- | ZDB-2-SCS |
No items available.