عنوان کتاب: Approximation algorithms for NP-hard problems
by Dorit Hochbaum
ناشر: PWS
سال: 1997
زبان: انگلیسی
تعداد صفحه (نسخه چاپی - نسخه الکترونیکی): 618-618
شابک: 9780534949686, 0534949681
نوع فایل: pdf
حجم: 40 مگابایت
این کتاب به صورت عکس می باشد
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.
دیدگاه خود را ثبت کنید