Skip to content

Opening book details…

Can I read Approximation Algorithms on EtoBox?

Approximation Algorithms by Vijay V. Vazirani is a reference work available to read on EtoBox.

What is Approximation Algorithms about?

Although this may seem a paradox, all exact science is dominated by the idea of approximation. Bertrand Russell (1872-1970) Most natural optimization problems, including those arising in important application areas, are NP-hard. Therefore, under the widely believed con jecture that P -=/= NP, their exact solution is prohibitively time consuming. Charting the landscape of approximability of these problems, via polynomial time algorithms, therefore becomes a compelling subject of scientific inquiry in computer science and mathematics. This book presents the theory of ap proximation algorithms as it stands today. It is reasonable to expect the picture to change with time. This book is divided into three parts. In Part I we cover combinato rial algorithms for a number of important problems, using a wide variety of algorithm design techniques. The latter may give Part I a non-cohesive appearance. However, this is to be expected - nature is very rich, and we cannot expect a few tricks to help solve the diverse collection of NP-hard problems. Indeed, in this part, we have purposely refrained from tightly cat egorizing algorithmic techniques so as not to trivialize matters. Instead, we hav

Who reads Approximation Algorithms?

It is typically read by readers who need quick, reliable lookup and repeat reference.

Common subject areas: reference, language, dictionaries and manuals.

Author
Vijay V. Vazirani
Publisher
Springer Spektrum. in Springer-Verlag GmbH
Published
2001
Language
EN
ISBN
9783540653677
Category
reference
Subjects
Mathematics, Computer Science, Business
Rating
4.24 / 5 (42 ratings)
Updated
2026-03-14

Other editions & translations

More by Vijay V. Vazirani

Browse all works by Vijay V. Vazirani

Similar books