Approximation algorithms (Record no. 11189)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 02051cam a22002414a 4500 |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| ISBN | 3540653678 (alk. paper) |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| ISBN | 9783540653677 |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| ISBN | 3642084699 |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| ISBN | 9783642084690 |
| 082 00 - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 005.1 |
| Item number | VAZ |
| 100 1# - MAIN ENTRY--AUTHOR NAME | |
| Personal name | Vazirani, Vijay V. |
| 245 10 - TITLE STATEMENT | |
| Title | Approximation algorithms |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) | |
| Place of publication | Berlin ; |
| -- | New York : |
| Name of publisher | Springer, |
| Year of publication | c2001. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Number of Pages | xix, 378 p. : |
| Other physical details | illustrations ; |
| 500 ## - GENERAL NOTE | |
| General note | Included Problem, Subject Index. |
| 505 ## - FORMATTED CONTENTS NOTE | |
| Formatted contents note | Combinatorial algorithms --<br/>Set cover --<br/>Steiner tree and TSP --<br/>Multiway cut and k-cut --<br/>k-center --<br/>Feedback vertex set --<br/>Shortest superstring --<br/>Knapsack --<br/>Bin packing --<br/>Minimum makespan scheduling --<br/>Euclidean TSP --<br/>LP-based algorithms --<br/>Introduction to LP-Duality --<br/>Set cover via dual fitting --<br/>Rounding applied to set cover --<br/>Set cover via the primal-dual schema --<br/>Maximum satisfiability --<br/>Scheduling on unrelated parallel machines --<br/>Multicut and integer multicommodity flow in trees --<br/>Multiway cut --<br/>Multicut in general graphs --<br/>Sparsest cut --<br/>Steiner forest --<br/>Steiner network --<br/>Facility location --<br/>k-median --<br/>Semidefinite programming --<br/>Other topics --<br/>Shortest vector --<br/>Counting problems --<br/>Hardness of approximation --<br/>Open problems --<br/>An overview of complexity theory for the algorithm designer --<br/>Basic facts from probability theory. |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc | "The challenge met by this book is to capture the beauty and excitement of work in this thriving field and to convey in a lucid manner the underlying theory and methodology. Many of the research results presented have been simplified, and new insights provided. Perhaps the most important aspect of the book is that it shows simple ways of talking about complex, powerful algorithmic ideas by giving intuitive proofs, |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical Term | Computer algorithms. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical Term | Mathematical optimization. |
| 856 42 - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | http://www.loc.gov/catdir/enhancements/fy0816/2001042005-d.html |
| 856 41 - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | http://www.loc.gov/catdir/enhancements/fy0816/2001042005-t.html |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | Reference Books |
| Collection code | Home library | Current library | Shelving location | Date acquired | Source of acquisition | Cost, normal purchase price | Full call number | Accession Number | Koha item type |
|---|---|---|---|---|---|---|---|---|---|
| Reference | Main Library | Main Library | Reference | 30/08/2005 | Purchased | 5236.00 | 005.1 VAZ | 009878 | Reference Books |