Zobacz książki o podobnej tematyce

Więcej informacji o Approximation Algorithms

• Dane szczegółowe
• Opis
• Ulubione w innej kategorii

Za ten zakup dostaniesz 179 punkty

Opis

This book covers the dominant theoretical approaches to the approximate solution of hard combinatorial optimization and enumeration problems. It contains elegant combinatorial theory, useful and interesting algorithms, and deep results about the intrinsic 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.§Richard Karp,University Professor, University of California at Berkeley§Following the development of basic combinatorial optimization techniques in the 1960s and 1970s, a main open question was to develop a theory of approximation algorithms. In the 1990s, parallel developments in techniques for designing approximation algorithms as well as methods for proving hardness of approximation results have led 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 approximation algorithms.§László Lovász, Senior Researcher, Microsoft ResearchCovering the basic techniques used in the latest research work, the author consolidates progress made so far, including some very recent and promising results, and conveys the beauty and excitement of work in the field. He gives clear, lucid explanations of key results and ideas, with intuitive proofs, and provides critical examples and numerous illustrations to help elucidate the algorithms. Many of the results presented have been simplified and new insights provided. Of interest to theoretical computer scientists, operations researchers, and discrete mathematicians.

Szczegóły książki

Kategoria Książki po angielsku Economics, finance, business & management Business & management Operational research

• Pełny tytuł: Approximation Algorithms
• Autor: Vijay V. Vazirani
• Język: Angielski
• Oprawa: Miękka
• Liczba stron: 380
• EAN: 9783642084690
• ISBN: 3642084699
• ID: 02108357
• Wydawca: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
• Waga: 622 g
• Wymiary: 159 × 235 × 19 mm
• Data wydania: 08. December 2010

Ulubione w innej kategorii

---

---

---