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.
|Genre:||Health and Food|
|Published (Last):||13 June 2014|
|PDF File Size:||3.13 Mb|
|ePub File Size:||1.5 Mb|
|Price:||Free* [*Free Regsitration Required]|
The University of Melbourne. Asif added it Nov 14, Does my optimized code use the smallest number of registers?
Mitch rated it liked it Nov 20, Thanks for telling us about the problem. Books by Dorit Hochbaum. We were unable to find this edition in any bookshop we are able to search.
Approximation Algorithms for NP-Hard Problems
Open to the public Book; Illustrated English Show 0 more libraries Notes Includes bibliographical references and index. Kalpit Soni marked it as to-read Jan 18, There algorithmss no discussion topics on this book yet.
Alberto Lopez added it Mar 02, Be the first to add this to a list. Raja added it Oct 11, Karven rated it really liked it Apr 21, Thang rated it liked it Nov 11, Add a tag Cancel Approximation algorithm K-approximation of k-hitting set.
The University of Sydney. Want to Read saving…. To include a comma in your tag, surround the tag with double quotes. Goemans and David P. In order dkrit set up a list of libraries that you have access to, approxikation must first login or sign up. Refresh and try again. Andrew rated it really liked it Jul 15, Ashish Goel agoel cs. Lists What are lists?
With chapters contributed by leading researchers in the prbolems, this book introduces algorifhms techniques in the analysis of approximation algorithms. Daniel marked it as to-read Feb 25, University of Sydney Library. The main theme will be the design of an approximation algorithm that doriit “close” to optimum for a given problem, and occasionally, to discover lower bounds on the best approximation possible.
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. PWS Publishing Company, The text includes a variety of pedagogical features: Piccolbo rated it really liked it Aug 26, Public Private login e. These 3 locations in New South Wales: Skip to content Skip to search.
Physical Description xxii, p. These 3 locations in Victoria: Tags What are tags? None of your libraries hold this item.
CS Approximation Algorithms for NP-hard Problems
A68 Book; Illustrated English Show 0 more libraries Shyamala Dasari rated it really liked it Nov 01, Approximation Algorithms for Bin Packing: Open to the public ; Approximating Covering and Packing Problems: 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.
Separate different tags with a comma.
Is a given Boolean formula satisfiable? George Vafiadis added it Dec 19,