LEADER 04507nam 22006735 450 001 9910299226303321 005 20200630083304.0 010 $a3-319-21275-3 024 7 $a10.1007/978-3-319-21275-3 035 $a(CKB)3710000000454186 035 $a(SSID)ssj0001584297 035 $a(PQKBManifestationID)16265333 035 $a(PQKBTitleCode)TC0001584297 035 $a(PQKBWorkID)14865678 035 $a(PQKB)11718233 035 $a(DE-He213)978-3-319-21275-3 035 $a(MiAaPQ)EBC6313185 035 $a(MiAaPQ)EBC5589001 035 $a(Au-PeEL)EBL5589001 035 $a(OCoLC)915052438 035 $a(PPN)190518855 035 $a(EXLCZ)993710000000454186 100 $a20150720d2015 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aParameterized Algorithms /$fby Marek Cygan, Fedor V. Fomin, ?ukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Micha? Pilipczuk, Saket Saurabh 205 $a1st ed. 2015. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2015. 215 $a1 online resource (XVII, 613 p. 84 illus., 25 illus. in color.) 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-319-21274-5 320 $aIncludes bibliographical references and index. 327 $aIntroduction -- 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. 330 $aThis 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. 606 $aAlgorithms 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aAlgorithms$3https://scigraph.springernature.com/ontologies/product-market-codes/M14018 615 0$aAlgorithms. 615 14$aAlgorithm Analysis and Problem Complexity. 615 24$aAlgorithms. 676 $a519.544 700 $aCygan$b Marek$4aut$4http://id.loc.gov/vocabulary/relators/aut$0718193 702 $aFomin$b Fedor V$4aut$4http://id.loc.gov/vocabulary/relators/aut 702 $aKowalik$b ?ukasz$4aut$4http://id.loc.gov/vocabulary/relators/aut 702 $aLokshtanov$b Daniel$4aut$4http://id.loc.gov/vocabulary/relators/aut 702 $aMarx$b Dániel$4aut$4http://id.loc.gov/vocabulary/relators/aut 702 $aPilipczuk$b Marcin$4aut$4http://id.loc.gov/vocabulary/relators/aut 702 $aPilipczuk$b Micha?$4aut$4http://id.loc.gov/vocabulary/relators/aut 702 $aSaurabh$b Saket$4aut$4http://id.loc.gov/vocabulary/relators/aut 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910299226303321 996 $aParameterized algorithms$91392410 997 $aUNINA