APPROXIMATION ALGORITHMS FOR N-P HARD PROBLEMS by Dorit Hochbaum ( 9780534949686 )

Item Details

Title:

APPROXIMATION ALGORITHMS FOR N-P HARD PROBLEMS

By:

Format:

Hardback

List price:	£46.99
We believe that this item is permanently unavailable, and so we cannot source it.

ISBN 10:

0534949681

ISBN 13:

9780534949686

Publisher:

CENGAGE LEARNING, INC

Pub. date:

25 August, 1996

Pages:

464

Description:

Discussing approximation algorithms for n-p hard problems, this study details scheduling, connectivity problems, randomization in approximations, best possible results, and on-line and server problems.

Synopsis:

This is the first book to fully address the study of approximation algorithms as a tool for coping with intractable problems. With chapters contributed by leading researchers in the field, this book introduces unifying techniques in the analysis of approximation algorithms. APPROXIMATION ALGORITHMS FOR NP-HARD PROBLEMS is intended for computer scientists and operations researchers interested in specific algorithm implementations, as well as design tools for algorithms. Among the techniques discussed: the use of linear programming, primal-dual techniques in worst-case analysis, semidefinite programming, computational geometry techniques, randomized algorithms, average-case analysis, probabilistically checkable proofs and inapproximability, and the Markov Chain Monte Carlo method. The text includes a variety of pedagogical features: definitions, exercises, open problems, glossary of problems, index, and notes on how best to use the book.

Illustrations:

Illustrations

Publication:

Imprint:

Course Technology Inc

Returns:

Non-returnable

Some other items by this author:

RANDOMIZATION, APPROXIMATION AND COMBINATORIAL OPTIMIZATION (PB)