Parameterized Algorithms

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 bas...

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Κύριοι συγγραφείς: Cygan, Marek (Συγγραφέας), Fomin, Fedor V. (Συγγραφέας), Kowalik, Łukasz (Συγγραφέας), Lokshtanov, Daniel (Συγγραφέας), Marx, Dániel (Συγγραφέας), Pilipczuk, Marcin (Συγγραφέας), Pilipczuk, Michał (Συγγραφέας), Saurabh, Saket (Συγγραφέας)
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Cham : Springer International Publishing : Imprint: Springer, 2015.
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 03674nam a22005055i 4500
001 978-3-319-21275-3
003 DE-He213
005 20151204150358.0
007 cr nn 008mamaa
008 150720s2015 gw | s |||| 0|eng d
020 |a 9783319212753  |9 978-3-319-21275-3 
024 7 |a 10.1007/978-3-319-21275-3  |2 doi 
040 |d GrThAP 
050 4 |a QA76.9.A43 
072 7 |a UMB  |2 bicssc 
072 7 |a COM051300  |2 bisacsh 
082 0 4 |a 005.1  |2 23 
100 1 |a Cygan, Marek.  |e author. 
245 1 0 |a Parameterized Algorithms  |h [electronic resource] /  |c by Marek Cygan, Fedor V. Fomin, Łukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michał Pilipczuk, Saket Saurabh. 
264 1 |a Cham :  |b Springer International Publishing :  |b Imprint: Springer,  |c 2015. 
300 |a XVII, 613 p. 84 illus., 25 illus. in color.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
505 0 |a 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 |a 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. 
650 0 |a Computer science. 
650 0 |a Algorithms. 
650 1 4 |a Computer Science. 
650 2 4 |a Algorithm Analysis and Problem Complexity. 
650 2 4 |a Algorithms. 
700 1 |a Fomin, Fedor V.  |e author. 
700 1 |a Kowalik, Łukasz.  |e author. 
700 1 |a Lokshtanov, Daniel.  |e author. 
700 1 |a Marx, Dániel.  |e author. 
700 1 |a Pilipczuk, Marcin.  |e author. 
700 1 |a Pilipczuk, Michał.  |e author. 
700 1 |a Saurabh, Saket.  |e author. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783319212746 
856 4 0 |u http://dx.doi.org/10.1007/978-3-319-21275-3  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
950 |a Computer Science (Springer-11645)