Approximation algorithms for NP-hard problems / edited by Dorit S. Hochbaum. Other Authors. Hochbaum, Dorit S. Published. Boston: PWS Pub. Co., c Publisher: PWS Publishing, Boston, Editors: D. Hochbaum, pp Workshop : Approximation Algorithms for NP-Hard Problems. Table of Dorit Hochbaum. Approximation Algorithms for NP-hard Problems. Front Cover. Dorit S. Hochbaum . PWS Publishing Company, – Mathematics – pages.
|Published (Last):||2 June 2015|
|PDF File Size:||10.91 Mb|
|ePub File Size:||6.22 Mb|
|Price:||Free* [*Free Regsitration Required]|
To see what your friends thought of this book, please sign up. Other Authors Hochbaum, Dorit S.
Gautam marked it as to-read Feb 24, Physical Description xxii, p. Shyamala Dasari rated it really liked it Nov 01, David added it Feb 01, Want to Read saving….
Steve Dalton marked it as to-read Oct 12, Subjects Programming Mathematics Approximation theory. Mitch rated it liked it Nov 20, These online bookshops told us they have this item: Is a given Boolean formula satisfiable? Ashish Goel agoel cs.
Court Corley rated it really liked it Oct 30, Saurav Banerjee marked it as to-read Nov 08, Add a tag Cancel Approximation algorithm K-approximation of k-hitting set. The main theme will be the design of an approximation algorithm that is “close” to optimum for a given problem, and occasionally, to discover lower bounds on the best approximation possible.
Hardcoverpages. Piccolbo rated it really liked it Aug 26, Goodreads helps you keep track of books you want to read.
Skip to content Skip to search. Thanks for telling us about the problem. Raja added it Oct 11, There are no discussion topics on this book yet.
Open to the public.
Approximation Algorithms for NP-Hard Problems
If you like books and love to build cool products, we may be looking for you. Dorlt and David P. The text includes a variety of pedagogical features: This single location in Queensland: The University of Melbourne.
Daniel marked it as to-read Feb 25, What is the best way of visiting all the cities on my itinerary?
BookDB marked it as to-read Spproximation 23, Login to add to list. Thang rated it liked it Nov 11, Aditya added it Apr 08, Books by Dorit Hochbaum. In order to set up a list of libraries that you have access to, you must first login or sign up.
Karven rated it really liked it Apr 21, Given the importance of these problems and the diversity of the application domains in which they arise, it is important to persist in the face of the difficulty of these problems and find good approximate solutions. We will also discuss the use of emerging technologies such as DNA and Quantum computation as tools for solving hard problems. Separate different tags with a comma.
Approximation Algorithms for NP-hard Problems – Google Books
Emma Jin marked it as to-read Apr yochbaum, Comments and reviews What are comments? Does my optimized code use the smallest number of registers? Then set up a personal list of libraries from your profile page by clicking on your user name at the top right of any screen.