The Multivariate Algorithmic Revolution and Beyond (eBook, PDF)

Essays Dedicated to Michael R. Fellows on the Occasion of His 60th Birthday
Redaktion: Bodlaender, Hans L.; Marx, Dániel; Fomin, Fedor V.; Downey, Rodney

• Format: PDF

Produktbeschreibung

Parameterized complexity is currently a thriving field in complexity theory and algorithm design. A significant part of the success of the field can be attributed to Michael R. Fellows. This Festschrift published in honor of Mike Fellows on the occasion of his 60th birthday. It contains 20 papers that showcase the important scientific contributions of this remarkable man describes the history of the field of parameterized complexity, and also reflects on other parts of Mike Fellows's unique and broad range of interests, including his work on the popularization of discrete mathematics for young children. The volume contains several surveys that introduce the reader to the field of parameterized complexity and discuss important notions, results, and developments in this field.

---

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

Produktdetails

• Verlag: Springer Berlin Heidelberg
• Seitenzahl: 506
• Erscheinungstermin: 16. Juni 2012
• Englisch
• ISBN-13: 9783642308918
• Artikelnr.: 44132080

Inhaltsangabe

Fixed-Parameter Tractability, A Prehistory.- The Birth and Early Years of Parameterized Complexity.- Crypto Galore!.- Flyby: Life Before, During, and After Graduate Studies with Mike Fellows.- The Impact of Parameterized Complexity to Interdisciplinary Problem Solving.- Vertex Cover, Dominating Set and My Encounters with Parameterized Complexity and Mike Fellows.- Mike Fellows: Weaving the Web of Mathematics and Adventure.- Passion Plays: Melodramas about Mathematics.- A Basic Parameterized Complexity Primer.- Kernelization - Preprocessing with a Guarantee.- Parameterized Complexity and Subexponential-Time Computability.- Fixed-Parameter Tractability of Treewidth and Pathwidth.- Graph Minors and Parameterized Algorithm Design.- Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey.- Backdoors to Satisfaction.- Studies in Computational Aspects of Voting: A Parameterized Complexity Perspective.- A Parameterized Halting Problem.- Computer Science Unplugged and Related Projects in Math and Computer Science Popularization.- FPT Suspects and Tough Customers: Open Problems of Downey and Fellows.- What's Next? Future Directions in Parameterized Complexity.