This newly expanded and updated second edition of the best-selling classic continues to
take the" mystery" out of designing algorithms, and analyzing their efficacy and efficiency …

A brilliant treatment of a knotty problem in computing. This volume contains chapters written
by reputable researchers and provides the state of the art in theory and algorithms for the …

We show that every language in NP has a probablistic verifier that checks membership
proofs for it using logarithmic number of random bits and by examining a constant number of …

Approximation algorithms have developed in response to the impossibility of solving a great
variety of important optimization problems. Too frequently, when attempting to get a solution …

Biology is in the midst of a era yielding many significant discoveries and promising many
more. Unique to this era is the exponential growth in the size of information-packed …

Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …

In one of the first major texts in the emerging field of computational molecular biology, Pavel
Pevzner covers a broad range of algorithmic and combinatorial topics and shows how they …

This paper addresses the smallest grammar problem: What is the smallest context-free
grammar that generates exactly one given string/spl sigma/? This is a natural question about …

We present a polynomial-time approximation algorithm with worst-case ratio 7/6 for the
special case of the traveling salesman problem in which all distances are either one or two …

This handbook provides an up-to-date compendium of fundamental computer science
topics, techniques, and applications. Along with updating and revising many of the existing …