Geometric Algorithms and Combinatorial Optimization / Najlacnejšie knihy
Geometric Algorithms and Combinatorial Optimization

Kod: 06621998

Geometric Algorithms and Combinatorial Optimization

Autor Alexander Schrijver

Since the publication of the first edition of our book, geometric algorithms and combinatorial optimization have kept growing at the same fast pace as before. Nevertheless, we do not feel that the ongoing research has made this bo ... więcej

174.90


Dostępna u dostawcy w małych ilościach
Wysyłamy za 13 - 16 dni

Potrzebujesz więcej egzemplarzy?Jeżeli jesteś zainteresowany zakupem większej ilości egzemplarzy, skontaktuj się z nami, aby sprawdzić ich dostępność.


Dodaj do schowka

Zobacz książki o podobnej tematyce

Bon podarunkowy: Radość gwarantowana

Wzór bonu podarunkowegoDowiedz się więcej

Więcej informacji o Geometric Algorithms and Combinatorial Optimization

Za ten zakup dostaniesz 440 punkty

Opis

Since the publication of the first edition of our book, geometric algorithms and combinatorial optimization have kept growing at the same fast pace as before. Nevertheless, we do not feel that the ongoing research has made this book outdated. Rather, it seems that many of the new results build on the models, algorithms, and theorems presented here. For instance, the celebrated Dyer-Frieze-Kannan algorithm for approximating the volume of a convex body is based on the oracle model of convex bodies and uses the ellipsoid method as a preprocessing technique. The polynomial time equivalence of optimization, separation, and membership has become a commonly employed tool in the study of the complexity of combinatorial optimization problems and in the newly developing field of computational convexity. Implementations of the basis reduction algorithm can be found in various computer algebra software systems. On the other hand, several of the open problems discussed in the first edition are still unsolved. For example, there are still no combinatorial polynomial time algorithms known for minimizing a submodular function or finding a maximum clique in a perfect graph. Moreover, despite the success of the interior point methods for the solution of explicitly given linear programs there is still no method known that solves implicitly given linear programs, such as those described in this book, and that is both practically and theoretically efficient. In particular, it is not known how to adapt interior point methods to such linear programs.

Szczegóły książki

Kategoria Książki po angielsku Reference, information & interdisciplinary subjects Research & information: general Information theory

174.90

Ulubione w innej kategorii



Osobní odběr Bratislava a 2642 dalších

Copyright ©2008-24 najlacnejsie-knihy.sk Wszelkie prawa zastrzeżonePrywatnieCookies


Konto: Logowanie
Všetky knihy sveta na jednom mieste. Navyše za skvelé ceny.

Nákupní košík ( prázdný )

Nakupte za 59,99 € a
máte doručení zdarma.

Twoja lokalizacja: