The design of approximation algorithms (Record no. 52283)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 01812cam a22002054a 4500 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 110114s2011 nyua b 001 0 eng |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| ISBN | 9780521195270 (Paperback) |
| 041 ## - LANGUAGE CODE | |
| Language code of text/sound track or separate title | eng |
| 080 ## - UNIVERSAL DECIMAL CLASSIFICATION NUMBER | |
| Universal Decimal Classification number | 681.3 |
| Item number | WIL |
| 100 1# - MAIN ENTRY--AUTHOR NAME | |
| Personal name | Williamson David P |
| 245 14 - TITLE STATEMENT | |
| Title | The design of approximation algorithms |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) | |
| Place of publication | New York |
| Name of publisher | Cambridge University Press |
| Year of publication | 2011. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Number of Pages | xi, 504 Pages |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc | "Discrete optimization problems are everywhere, from traditional operations research planning problems, such as scheduling, facility location, and network design; to computer science problems in databases; to advertising issues in viral marketing. Yet most such problems are NP-hard. Thus unless P = NP, there are no efficient algorithms to find optimal solutions to such problems. This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions. The book is organized around central algorithmic techniques for designing approximation algorithms, including greedy and local search algorithms, dynamic programming, linear and semidefinite programming, and randomization. Each chapter in the first part of the book is devoted to a single algorithmic technique, which is then applied to several different problems. The second part revisits the techniques but offers more sophisticated treatments of them. The book also covers methods for proving that optimization problems are hard to approximate. Designed as a textbook for graduate-level algorithms courses, the book will also serve as a reference for researchers interested in the heuristic solution of discrete optimization problems"-- |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical Term | Approximation theory. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical Term | Mathematical optimization. |
| 690 ## - LOCAL SUBJECT ADDED ENTRY--TOPICAL TERM (OCLC, RLIN) | |
| Topical term or geographic name as entry element | Computer Science |
| 700 1# - ADDED ENTRY--PERSONAL NAME | |
| Personal name | Shmoys, David Bernard |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | BOOKS |
| Withdrawn status | Lost status | Damaged status | Not for loan | Current library | Shelving location | Full call number | Accession Number | Koha item type |
|---|---|---|---|---|---|---|---|---|
| IMSc Library | Second Floor, Rack No: 46, Side No: 2, Shelf No: 22 | 681.3 WIL | 74259 | BOOKS |