RECORD DETAIL
Back To Previous
Back To Previous
| Title | Approximation Algorithms for NP-Hard Problems |
| Edition | 1 |
| Call Number | |
| ISBN/ISSN | |
| Author(s) | Hochbaum, Dorit S. |
| Subject(s) | ALGORITHMS APPROXIMATION THEORY PROGRAMMING (MATHEMATICS) |
| Classification | 511.42 |
| Series Title | GMD | Buku |
| Language | Inggris |
| Publisher | PWS Publishing |
| Publishing Year | 1997 |
| Publishing Place | Boston |
| Collation | |
| Abstract/Notes | |
| Specific Detail Info | 1. Approximation Algorithms for Scheduling; 2. Approximation Algorithms for Bin Packing : A Survey; 3. Approximating Covering and Packing Problems : Set Cover, Vertex Cover, Independent Set, and Related Problems; 4. The Primal-Dual Methods for Approximation Algorithms and Its Application to Network Design Problems; 5. Cut Problems and Their Application ti Devide-and-Conquer;… |
| Image |  |
| File Attachment | LOADING LIST... |
| Pembimbing | |
| Volume | |
| Availability | LOADING LIST... |
| Back To Previous |