Scribd
Upload
162 views

Vazirani

Uploaded by

ps1406051
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
162 views

Vazirani

Uploaded by

ps1406051
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

VIJAY V.

VAZIRANI

VAZIRANI
Approximation Algorithms VIJAY V. VAZIRANI
“This book covers the dominant theoretical approaches to the approximate solution of
hard combinatorial optimization and enumeration problems. It contains elegant combi-
natorial theory, useful and interesting algorithms, and deep results about the intrinsic 1
complexity of combinatorial problems. Its clarity of exposition and excellent selection of
exercises will make it accessible and appealing to all those with a taste for mathematics
and algorithms.”

Algorithms
Approximation
Richard Karp, University Professor
University of California at Berkeley

“Following the development of basic combinatorial optimization techniques in the


Approximation
1960s and 1970s, a main open question was to develop a theory of approximation algo-
rithms. In the 1990s, parallel developments in techniques for designing approximation
algorithms as well as methods for proving hardness of approximation results have led
Algorithms
to a beautiful theory.The need to solve truly large instances of computationally hard
problems, such as those arising from the Internet or the human genome project, has
also increased interest in this theory.The field is currently very active, with the toolbox
of approximation algorithm design techniques getting always richer.
It is a pleasure to recommend Vijay Vazirani’s well-written and comprehensive book on
this important and timely topic. I am sure the reader will find it most useful both as an
introduction to approximability as well as a reference to the many aspects of approxi-
mation algorithms.”
László Lovász, Senior Researcher
Microsoft Research

ISBN 3-540-65367-8

9 783540 653677

http://www.springer.de 123

You might also like