This book is an up-to-date documentation of the state of the art in combinatorial optimization, presenting approximate solutions of virtually all relevant classes of NP-hard optimization problems. The well-structured wealth of problems, algorithms, results, and techniques introduced systematically w
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
β Scribed by G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela and M. Protasi
- Tongue
- English
- Leaves
- 538
- Category
- Library
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
<p>N COMPUTER applications we are used to live with approximation. VarΒ I ious notions of approximation appear, in fact, in many circumstances. One notable example is the type of approximation that arises in numerΒ ical analysis or in computational geometry from the fact that we cannot perform compu
This book constitutes the refereed proceedings of the Third International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM'99, held jointly with the Second International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX'99, in Berk
This book constitutes the refereed proceedings of the Third International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM'99, held jointly with the Second International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX'99, in Berk