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):||23 February 2008|
|PDF File Size:||16.7 Mb|
|ePub File Size:||20.43 Mb|
|Price:||Free* [*Free Regsitration Required]|
In order to set up a list of libraries that you have access to, you must first login or sign up.
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. You also may like to try some of these bookshopswhich may or may not sell this item.
Separate different tags with a comma. To include a comma in your tag, surround the tag with double quotes. Skip to content Skip to search. Home This editionEnglish, Book, Illustrated edition: Other Authors Hochbaum, Dorit S. Physical Description xxii, p.
Subjects Programming Mathematics Approximation theory. Approximation Algorithms for Bin Packing: Approximating Covering and Packing Problems: Goemans and David P. Various Notions of Approximations: Notes Includes bibliographical references and index. View online Borrow Buy Freely available Show 0 more links Approxi,ation up My libraries How do I set up “My libraries”?
These 9 locations in All: Australian National University Library. Open to the public.
Approximation Algorithms for NP-Hard Problems
Open to the public ; T Open to the public ; Mos Open to the public ; The University of Melbourne Library. University of Sydney Library.
These 2 locations in Australian Capital Territory: These 3 locations in New South Wales: This single location in Queensland: A68 Book; Illustrated English Show 0 more libraries These 3 locations in Victoria: Open to the public Book; Illustrated English Show 0 more libraries None prblems your libraries hold this item.
Found at these bookshops Searching – please wait We were unable to find this edition in any bookshop we are able to search. These online bookshops told us they have this item: Tags What are tags? Public Private login e. Add a tag Cancel Approximation algorithm K-approximation of k-hitting set.
Lists What are lists? Login to add to list.
Approximation Algorithms for NP-Hard Problems by Dorit Hochbaum
Be the first to add this to a list. Comments and reviews What are comments? The University of Melbourne. The University of Sydney.