Klik op een omslag om naar Google Boeken te gaan.
Bezig met laden... Approximation Algorithms for NP-Hard Problemsdoor Dorit Hochbaum
Geen Bezig met laden...
Meld je aan bij LibraryThing om erachter te komen of je dit boek goed zult vinden. Op dit moment geen Discussie gesprekken over dit boek. Geen besprekingen geen besprekingen | voeg een bespreking toe
This is the first book to fully address the study of approximation algorithms as a tool for coping with intractable problems. With chapters contributed by leading researchers in the field, this book introduces unifying techniques in the analysis of approximation algorithms. APPROXIMATION ALGORITHMS FOR NP-HARD PROBLEMS is intended for computer scientists and operations researchers interested in specific algorithm implementations, as well as design tools for algorithms. Among the techniques discussed: the use of linear programming, primal-dual techniques in worst-case analysis, semidefinite programming, computational geometry techniques, randomized algorithms, average-case analysis, probabilistically checkable proofs and inapproximability, and the Markov Chain Monte Carlo method. The text includes a variety of pedagogical features: definitions, exercises, open problems, glossary of problems, index, and notes on how best to use the book. Geen bibliotheekbeschrijvingen gevonden. |
Actuele discussiesGeen
Google Books — Bezig met laden... GenresDewey Decimale Classificatie (DDC)511.42Natural sciences and mathematics Mathematics General Principles Approximation TheoryLC-classificatieWaarderingGemiddelde:
Ben jij dit?Word een LibraryThing Auteur. |