Kaikki kirjat 25 % alennuksella koodilla: BOOKS

  • check Yli 10 miljoonaa kirjaa
  • check Uutuuksia joka päivä
  • check Yli 1 miljoona asiakasta luottaa meihin
  • check Hyvät hinnat ja alennukset
  • check Toimitus koko Eurooppaan

Parameterized Algorithms - Daniel Lokshtanov,Micha¿ Pilipczuk,Dániel Marx,Marek Cygan,Marcin Pilipczuk,Fedor V. Fomin,¿Ukasz Kowalik,Saket Saurabh

englanti
2015-08-03
92,80 € 123,73 €

-25% koodilla BOOKS

Toimittajalla varastossa

Toimitus 17-23 arkipäivässä

30 päivän palautusoikeus

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 ... Täydellinen kuvaus

Saatat myös pitää

Kuvaus

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

Lisätietoja

Kirjoittaja Daniel Lokshtanov, Micha¿ Pilipczuk, Dániel Marx, Marek Cygan, Marcin Pilipczuk, Fedor V. Fomin, ¿Ukasz Kowalik, Saket Saurabh
Julkaisija Springer Nature Switzerland
Julkaisuvuosi 2015
Kannen tyyppi Kovakantinen
EAN 9783319212746
Kirjoita oma arvostelusi
Arvostelet: Parameterized Algorithms
Arvostelusi:

Goodreads-arvostelut

92,80 € 123,73 €