This book shows how runtime behavior can be analyzed in a rigorous way and for combinatorial optimization in particular. It presents well-known problems such as minimum spanning trees, shortest paths, maximum matching, and covering and scheduling problems.
This concise introduction is ideal for readers familiar with programming and basic mathematical language. It uses pictures, words and high-level pseudocode to explain algorithms and presents efficient implementations using real programming languages.
This book introduces some key problems in bioinformatics, discusses the models used to formally describe these problems, and analyzes the algorithmic approaches used to solve them. This book presents formal models in a mathematically precise, yet intuitive manner.
This text is a compendium of revised and extended articles written for the international conference on Advances in Computational Algorithms and Data Analysis. It presents state-of-the-art advances in the field through discussion of various topics.