Fundamentals of Parameterized Complexity

Michael R. Fellows

ISBN 10: 1447171640 / ISBN 13: 9781447171645

Verlag: Springer London, Springer London Aug 2016, 2016

Beschreibung

Neuware -This comprehensive and self-contained textbook presents an accessible overview of the state of the art of multivariate algorithmics and complexity. Increasingly, multivariate algorithmics is having significant practical impact in many application domains, with even more developments on the horizon. The text describes how the multivariate framework allows an extended dialog with a problem, enabling the reader who masters the complexity issues under discussion to use the positive and negative toolkits in their own research. Features: describes many of the standard algorithmic techniques available for establishing parametric tractability; reviews the classical hardness classes; explores the various limitations and relaxations of the methods; showcases the powerful new lower bound techniques; examines various different algorithmic solutions to the same problems, highlighting the insights to be gained from each approach; demonstrates how complexity methods and ideas have evolved over the past 25 years.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 796 pp. Englisch.

Bestandsnummer des Verkäufers 9781447171645

Bibliografische Details

• Titel: Fundamentals of Parameterized Complexity
• Verlag: Springer London, Springer London Aug 2016
• Erscheinungsjahr: 2016
• Sprache: Englisch
• ISBN-10: 1447171640
• ISBN-13: 9781447171645
• Einband: Taschenbuch
• Zustand: Neu

Über diesen Titel

Inhaltsangabe

This comprehensive and self-contained textbook presents an accessible overview of the state of the art of multivariate algorithmics and complexity. Increasingly, multivariate algorithmics is having significant practical impact in many application domains, with even more developments on the horizon. The text describes how the multivariate framework allows an extended dialog with a problem, enabling the reader who masters the complexity issues under discussion to use the positive and negative toolkits in their own research. Features: describes many of the standard algorithmic techniques available for establishing parametric tractability; reviews the classical hardness classes; explores the various limitations and relaxations of the methods; showcases the powerful new lower bound techniques; examines various different algorithmic solutions to the same problems, highlighting the insights to be gained from each approach; demonstrates how complexity methods and ideas have evolved over the past 25 years.

Über die Autorin bzw. den Autor

Dr. Rodney G. Downey is a Professor in the School of Mathematics, Statistics and Operations Research, at the Victoria University of Wellington, New Zealand.

Dr. Michael R. Fellows is a Professor in the School of Engineering and Information Technology, at the Charles Darwin University, Darwin, NT, Australia.