Parameterized Complexity

M. R. Fellows

ISBN 10: 038794883X / ISBN 13: 9780387948836

Verlag: Springer New York, Springer US Nov 1998, 1998

Beschreibung

Neuware -The idea for this book was conceived over the second bottle of Villa Maria's Caber net Medot '89, at the dinner of the Australasian Combinatorics Conference held at Palmerston North, New Zealand in December 1990, where the authors first met and discovered they had a number of interests in common. Initially, we embarked on a small project to try to formulate reductions to address the apparent parame terized intractability of DOMINATING SET, and to introduce a structure in which to frame our answers. Having spent several months trying to get the definitions for the reductions right (they now seem so obvious), we turned to our tattered copies of Garey and Johnson's work [239]. We were stunned to find that virtually none of the classical reductions worked in the parameterized setting. We then wondered if we'd be able to find any interesting reductions. Several years, many more bottles, so many papers, and reductions later it [3] seemed that we had unwittingly stumbled upon what we believe is a truly central and new area of complexity theory. It seemed to us that the material would be of great interest to people working in areas where exact algorithms for a small range of parameters are natural and useful (e. g. , Molecular Biology, VLSI design). The tractability theory was rich with distinctive and powerful techniques. The intractability theory seemed to have a deep structure and techniques all of its own.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 556 pp. Englisch.

Bestandsnummer des Verkäufers 9780387948836

Bibliografische Details

• Titel: Parameterized Complexity
• Verlag: Springer New York, Springer US Nov 1998
• Erscheinungsjahr: 1998
• Sprache: Englisch
• ISBN-10: 038794883X
• ISBN-13: 9780387948836
• Einband: Buch
• Zustand: Neu

Über diesen Titel

Inhaltsangabe

An approach to complexity theory which offers a means of analysing algorithms in terms of their tractability. The authors consider the problem in terms of parameterized languages and taking "k-slices" of the language, thus introducing readers to new classes of algorithms which may be analysed more precisely than was the case until now. The book is as self-contained as possible and includes a great deal of background material. As a result, computer scientists, mathematicians, and graduate students interested in the design and analysis of algorithms will find much of interest.