A complete introduction to recent advances in preprocessing analysis, or kernelization, with extensive examples using a single data set.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Fedor V. Fomin is Professor of Computer Science at the Universitetet i Bergen, Norway. He is known for his work in algorithms and graph theory. He has co-authored two books, Exact Exponential Algorithms (2010) and Parameterized Algorithms (2015), and received the EATCS Nerode prizes in 2015 and 2017 for his work on bidimensionality and Measure and Conquer.
Daniel Lokshtanov is Professor of Informatics at the Universitetet i Bergen, Norway. His main research interests are in graph algorithms, parameterized algorithms, and complexity. He is a co-author of Parameterized Algorithms (2015) and is a recipient of the Meltzer prize, the Bergen Research Foundation young researcher grant, and an ERC starting grant on parameterized algorithms.
Saket Saurabh is Professor of Theoretical Computer Science at the Institute of Mathematical Sciences, Chennai, and Professor of Computer Science at the Universitetet i Bergen, Norway. He has made important contributions to every aspect of parametrized complexity and kernelization, especially to general purpose results in kernelization and applications of extremal combinatorics in designing parameterized algorithms. He is a co-author of Parameterized Algorithms (2015).
Meirav Zehavi is Assistant Professor of Computer Science at Ben-Gurion University. Her research interests lie primarily in the field of parameterized complexity. In her Ph.D. studies, she received three best student paper awards.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
EUR 13,97 per la spedizione da Regno Unito a Italia
Destinazione, tempi e costiEUR 0,54 per la spedizione da U.S.A. a Italia
Destinazione, tempi e costiDa: Prior Books Ltd, Cheltenham, Regno Unito
Hardcover. Condizione: Like New. First Edition. A firm and square hardback with sharp corners and strong joints, just showing a few very minor cosmetic rubs. Hence a non-text page has a 'damaged' stamp. Despite such this book is actually in nearly new condition and appears unread. Thus the contents are crisp, fresh and tight; no pen-marks. Now offered for sale at a very sensible price. Codice articolo 208971
Quantità: 1 disponibili
Da: ThriftBooks-Atlanta, AUSTELL, GA, U.S.A.
Hardcover. Condizione: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less 1.9. Codice articolo G1107057760I4N00
Quantità: 1 disponibili
Da: PBShop.store US, Wood Dale, IL, U.S.A.
HRD. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo FM-9781107057760
Quantità: 4 disponibili
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
HRD. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo FM-9781107057760
Quantità: 4 disponibili
Da: Books Puddle, New York, NY, U.S.A.
Condizione: New. Codice articolo 26376453596
Quantità: 1 disponibili
Quantità: 1 disponibili
Da: Revaluation Books, Exeter, Regno Unito
Hardcover. Condizione: Brand New. 515 pages. 9.50x6.25x1.25 inches. In Stock. Codice articolo __1107057760
Quantità: 1 disponibili
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
Hardback. Condizione: New. New copy - Usually dispatched within 4 working days. 953. Codice articolo B9781107057760
Quantità: Più di 20 disponibili
Da: Biblios, Frankfurt am main, HESSE, Germania
Condizione: New. Codice articolo 18376453590
Quantità: 4 disponibili
Da: CitiRetail, Stevenage, Regno Unito
Hardcover. Condizione: new. Hardcover. Preprocessing, or data reduction, is a standard technique for simplifying and speeding up computation. Written by a team of experts in the field, this book introduces a rapidly developing area of preprocessing analysis known as kernelization. The authors provide an overview of basic methods and important results, with accessible explanations of the most recent advances in the area, such as meta-kernelization, representative sets, polynomial lower bounds, and lossy kernelization. The text is divided into four parts, which cover the different theoretical aspects of the area: upper bounds, meta-theorems, lower bounds, and beyond kernelization. The methods are demonstrated through extensive examples using a single data set. Written to be self-contained, the book only requires a basic background in algorithmics and will be of use to professionals, researchers and graduate students in theoretical computer science, optimization, combinatorics, and related fields. This self-contained introduction to kernelization, a rapidly developing area of preprocessing analysis, is for researchers, professionals, and graduate students in computer science and optimization. It includes recent advances in upper and lower bounds and meta-theorems, and demonstrates methods through extensive examples using a single data set. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. Codice articolo 9781107057760
Quantità: 1 disponibili