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.
||18 July 2012
|PDF File Size:
|ePub File Size:
||Free* [*Free Regsitration Required]
Approximation Algorithms for NP-hard Problems – Google Books
Nikolas Co added it Mar 15, Mitch rated it liked it Nov 20, If you like books and love to build cool products, we may be looking for you. Books by Dorit Hochbaum.
Daniel marked it as to-read Feb 25, Just a moment while we sign you in to your Goodreads account. Piccolbo rated it really liked it Aug 26, Public Private cor e.
You also may like to try some of these bookshopswhich may or may not sell this item. Contact the instructor for more details. None of your libraries hold this item. This fof the first book to fully address the study of approximation algorithms as a tool for coping with intractable problems. Approximation Algorithms for NP-hard Problems.
CS Approximation Algorithms for NP-hard Problems
BookDB marked it as to-read Sep 23, David added it Feb 01, Shyamala Dasari rated it really liked it Nov 01, Skip to content Skip to search. Karven hhard it really liked it Apr 21, These 2 locations in Australian Capital Territory: View online Borrow Buy Freely available Show 0 more links Open Preview See a Problem?
The text includes a variety of pedagogical features: Australian National University Library. Lists What are lists? Physical Description xxii, p. Found at these bookshops Searching – please wait Subjects Programming Mathematics Nl theory. Open to the public ; Mos University of Sydney Library.
Raja added it Oct 11, Court Corley rated it really liked it Oct 30, 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. Want to Read saving…. Edited by Dorit S.
Rado added it Aug 20, Open to the public Book; Illustrated English Show 0 more libraries Aditya added it Apr 08, Goodreads helps you keep track of books you want to read.
Asif added it Nov 14, Comments and reviews What are comments? The University of Sydney.
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. Steve Dalton marked it as to-read Oct 12, George Vafiadis added it Dec 19,