Nemokamas pristatymas nuo 29€

  • check 10 + milijonai knygų
  • check Naujienos (kiekvieną dieną)
  • check 1 + mln. klientų mus pasitiki
  • check Geros kainos % Nuolaidos
  • check Nemokamas pristatymas nuo 29 eur

Approximation Algorithms - Vijay V. Vazirani

Anglų
2002-12-05
143,85 € 191,80 €

-25% su kodu BOOKS

Minkšti viršeliai Kieti viršeliai 191,80 €
Turime sandėlyje pas mūsų tiekėją

Pristatymas per 10-16 d.d.

30 dienų grąžinimo politika

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, v ... Visas aprašymas

Jums taip pat gali patikti

Aprašymas

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 have attempted to capture, as accurately as possible, the individual character of each problem, and point out connections between problems and algorithms for solving them.

Daugiau informacijos

Autorius Vijay V. Vazirani
Leidėjas Springer Science & Business Media
Išleidimo metai 2002
Viršelio tipas Kieti viršeliai
EAN 9783540653677
Parašykite savo atsiliepimą
Jūs peržiūrėjote: Approximation Algorithms
Jūsų įvertinimas:

Goodreads Atsiliepimai

143,85 € 191,80 €