Invitation to Fixed-Parameter Algorithms
Invitation to Fixed-Parameter Algorithms

Author: Rolf Niedermeier

Publisher: OUP Oxford

Published: 2006-02-02

Total Pages: 316

ISBN-13: 0191524158

DOWNLOAD EBOOK

This research-level text is an application-oriented introduction to the growing and highly topical area of the development and analysis of efficient fixed-parameter algorithms for optimally solving computationally hard combinatorial problems. The book is divided into three parts: a broad introduction that provides the general philosophy and motivation; followed by coverage of algorithmic methods developed over the years in fixed-parameter algorithmics forming the core of the book; and a discussion of the essentials from parameterized hardness theory with a focus on W[1]-hardness which parallels NP-hardness, then stating some relations to polynomial-time approximation algorithms, and finishing up with a list of selected case studies to show the wide range of applicability of the presented methodology. Aimed at graduate and research mathematicians, programmers, algorithm designers, and computer scientists, the book introduces the basic techniques and results and provides a fresh view on this highly innovative field of algorithmic research.

Invitation to Fixed-Parameter Algorithms
Invitation to Fixed-Parameter Algorithms

Author: Rolf Niedermeier

Publisher: OUP Oxford

Published: 2006-02-02

Total Pages: 316

ISBN-13: 9780198566076

DOWNLOAD EBOOK

An application-oriented introduction to the highly topical area of the development and analysis of efficient fixed-parameter algorithms for hard problems. Aimed at graduate and research mathematicians, algorithm designers, and computer scientists, it provides a fresh view on this highly innovative field of algorithmic research.

Parameterized Algorithms
Parameterized Algorithms

Author: Marek Cygan

Publisher: Springer

Published: 2015-07-20

Total Pages: 618

ISBN-13: 3319212753

DOWNLOAD EBOOK

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 presents complexity 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.

Fixed-Parameter Linear-Time Algorithms for NP-hard Graph and Hypergraph Problems Arising in Industrial Applications
Fixed-Parameter Linear-Time Algorithms for NP-hard Graph and Hypergraph Problems Arising in Industrial Applications

Author: Bevern, René van

Publisher: Universitätsverlag der TU Berlin

Published: 2014-10-01

Total Pages: 229

ISBN-13: 379832705X

DOWNLOAD EBOOK

This thesis aims for the development of efficient algorithms to exactly solve four selected NP-hard graph and hypergraph problems arising in the fields of scheduling, steel manufactoring, software engineering, radio frequency allocation, computer-aided circuit design, and social network analysis. NP-hard problems presumably cannot be solved exactly in a running time growing only polynomially with the input size. In order to still solve the considered problems efficiently, this thesis develops linear-time data reduction and fixed-parameter linear-time algorithms—algorithms that can be proven to run in linear time if certain parameters of the problem instances are constant. Besides proving linear worst-case running times, the efficiency of most of the developed algorithms is evaluated experimentally. Moreover, the limits of fixed-parameter linear-time algorithms and provably efficient and effective data reduction are shown. Diese Dissertation beschäftigt sich mit der Entwicklung effizienter Algorithmen zur exakten Lösung vier ausgewählter NP-schwerer Probleme aus der Ablaufplanung, Stahlverarbeitung, Softwaretechnik, Frequenzzuteilung, aus der computergestützten Hardwareentwicklung und der Analyse sozialer Netzwerke. NP-schwere Probleme können vermutlich nicht optimal in einer polynomiell mit der Eingabegröße wachsenden Zeit gelöst werden. Um sie dennoch effizient zu lösen, entwickelt diese Arbeit Linearzeitdatenreduktionsalgorithmen und Festparameter-Linearzeitalgorithmen – Algorithmen, die beweisbar in Linearzeit laufen, wenn bestimmte Parameter der Probleminstanzen konstant sind. Hierbei wird nicht nur bewiesen, dass die entwickelten Algorithmen in Linearzeit laufen, es findet zusätzlich eine experimentelle Evaluation der meisten der entwickelten Algorithmen statt. Ferner werden die Grenzen von Festparameter-Linearzeitalgorithmen und beweisbar effizienter und effektiver Datenreduktion aufgezeigt.

Algorithms and Theory of Computation Handbook - 2 Volume Set
Algorithms and Theory of Computation Handbook - 2 Volume Set

Author: Mikhail J. Atallah

Publisher: CRC Press

Published: 2022-05-29

Total Pages: 1904

ISBN-13: 1439832331

DOWNLOAD EBOOK

Algorithms and Theory of Computation Handbook, Second Edition in a two volume set, provides an up-to-date compendium of fundamental computer science topics and techniques. It also illustrates how the topics and techniques come together to deliver efficient solutions to important practical problems. New to the Second Edition: Along with updating and revising many of the existing chapters, this second edition contains more than 20 new chapters. This edition now covers external memory, parameterized, self-stabilizing, and pricing algorithms as well as the theories of algorithmic coding, privacy and anonymity, databases, computational games, and communication networks. It also discusses computational topology, computational number theory, natural language processing, and grid computing and explores applications in intensity-modulated radiation therapy, voting, DNA research, systems biology, and financial derivatives. This best-selling handbook continues to help computer professionals and engineers find significant information on various algorithmic topics. The expert contributors clearly define the terminology, present basic results and techniques, and offer a number of current references to the in-depth literature. They also provide a glimpse of the major research issues concerning the relevant topics

Algorithms and Data Structures
Algorithms and Data Structures

Author: Frank Dehne

Publisher: Springer Science & Business Media

Published: 2011-07-18

Total Pages: 730

ISBN-13: 3642222994

DOWNLOAD EBOOK

Annotation Constituting the refereed proceedings of the 12th Algorithms and Data Structures Symposium held in New York in August 2011, this text presents original research on the theory and application of algorithms and data structures in all areas, including combinatorics, computational geometry and databases.

Parameterized and Exact Computation
Parameterized and Exact Computation

Author: Hans L. Bodlaender

Publisher: Springer Science & Business Media

Published: 2006-09-12

Total Pages: 289

ISBN-13: 3540390987

DOWNLOAD EBOOK

Here are the refereed proceedings of the Second International Workshop on Parameterized and Exact Computation, IWPEC 2006, held in the context of the combined conference ALGO 2006. The book presents 23 revised full papers together with 2 invited lectures. Coverage includes research in all aspects of parameterized and exact computation and complexity, including new techniques for the design and analysis of parameterized and exact algorithms, parameterized complexity theory, and more.

Encyclopedia of Algorithms
Encyclopedia of Algorithms

Author: Ming-Yang Kao

Publisher: Springer Science & Business Media

Published: 2008-08-06

Total Pages: 1200

ISBN-13: 0387307702

DOWNLOAD EBOOK

One of Springer’s renowned Major Reference Works, this awesome achievement provides a comprehensive set of solutions to important algorithmic problems for students and researchers interested in quickly locating useful information. This first edition of the reference focuses on high-impact solutions from the most recent decade, while later editions will widen the scope of the work. All entries have been written by experts, while links to Internet sites that outline their research work are provided. The entries have all been peer-reviewed. This defining reference is published both in print and on line.

Algorithms and Theory of Computation Handbook, Volume 1
Algorithms and Theory of Computation Handbook, Volume 1

Author: Mikhail J. Atallah

Publisher: CRC Press

Published: 2009-11-20

Total Pages: 974

ISBN-13: 1584888237

DOWNLOAD EBOOK

Algorithms and Theory of Computation Handbook, Second Edition: General Concepts and Techniques provides an up-to-date compendium of fundamental computer science topics and techniques. It also illustrates how the topics and techniques come together to deliver efficient solutions to important practical problems. Along with updating and revising many

Mathematical Foundations of Computer Science 2004
Mathematical Foundations of Computer Science 2004

Author: Jirí Fiala

Publisher: Springer

Published: 2004-08-06

Total Pages: 916

ISBN-13: 3540286292

DOWNLOAD EBOOK

This volume contains the papers presented at the 29th Symposium on Mat- matical Foundations of Computer Science, MFCS 2004, held in Prague, Czech Republic, August 22–27, 2004. The conference was organized by the Institute for Theoretical Computer Science (ITI) and the Department of Theoretical Com- terScienceandMathematicalLogic(KTIML)oftheFacultyofMathematicsand Physics of Charles University in Prague. It was supported in part by the Eu- pean Association for Theoretical Computer Science (EATCS) and the European Research Consortium for Informatics and Mathematics (ERCIM). Traditionally, the MFCS symposia encourage high-quality research in all branches of theoretical computer science. Ranging in scope from automata, f- mal languages, data structures, algorithms and computational geometry to c- plexitytheory,modelsofcomputation,andapplicationsincludingcomputational biology, cryptography, security and arti?cial intelligence, the conference o?ers a unique opportunity to researchers from diverse areas to meet and present their results to a general audience. The scienti?c program of this year’s MFCS took place in the lecture halls of the recently reconstructed building of the Faculty of Mathematics and P- sics in the historical center of Prague, with the famous Prague Castle and other celebratedhistoricalmonumentsinsight.Theviewfromthewindowswasach- lengingcompetitionforthespeakersinthe?ghtfortheattentionoftheaudience. But we did not fear the result: Due to the unusually tough competition for this year’s MFCS, the admitted presentations certainly attracted considerable in- rest. The conference program (and the proceedings) consisted of 60 contributed papers selected by the Program Committee from a total of 167 submissions.