The Design of Approximation Algorithms (Record no. 12268)
[ view plain ]
000 -LEADER | |
---|---|
fixed length control field | 01848nmm a2200205Ia 4500 |
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
fixed length control field | 220920s9999||||xx |||||||||||||| ||und|| |
020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
International Standard Book Number | 9780511921735 |
082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER | |
Classification number | 518.5 |
Item number | W676D |
100 ## - MAIN ENTRY--PERSONAL NAME | |
Personal name | Williamson, D. P. |
Relator term | Author |
Language of a work | English |
9 (RLIN) | 1942 |
245 #4 - TITLE STATEMENT | |
Title | The Design of Approximation Algorithms |
Statement of responsibility, etc. | / by D. P. Williamson and D. B. Shmoys. |
Medium | [Electronic Resource] |
260 ## - PUBLICATION, DISTRIBUTION, ETC. | |
Place of publication, distribution, etc. | Cambridge |
Name of publisher, distributor, etc. | : Cambridge University Press, |
Date of publication, distribution, etc. | 2011 |
300 ## - PHYSICAL DESCRIPTION | |
Extent | xii, 504p. |
520 ## - SUMMARY, ETC. | |
Summary, etc. | Discrete optimization problems are everywhere, from traditional operations research planning (scheduling, facility location and network design); to computer science databases; to advertising issues in viral marketing. Yet most such problems are NP-hard; unless P = NP, there are no efficient algorithms to find optimal solutions. 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 section is devoted to a single algorithmic technique applied to several different problems, with more sophisticated treatment in the second section. The book also covers methods for proving that optimization problems are hard to approximate. Designed as a textbook for graduate-level algorithm courses, it will also serve as a reference for researchers interested in the heuristic solution of discrete optimization problems. |
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical term or geographic name entry element | Algorithmics |
9 (RLIN) | 15757 |
Topical term or geographic name entry element | Computer Science |
9 (RLIN) | 926 |
Topical term or geographic name entry element | Optimisation |
9 (RLIN) | 1944 |
700 ## - ADDED ENTRY--PERSONAL NAME | |
Personal name | Shmoys, D. B. |
Relationship information | [Author] |
9 (RLIN) | 1945 |
856 ## - ELECTRONIC LOCATION AND ACCESS | |
Uniform Resource Identifier | <a href="https://doi.org/10.1017/CBO9780511921735">https://doi.org/10.1017/CBO9780511921735</a> |
Electronic format type | |
Link text | Click to Access the Online Book |
942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
Koha item type | e-Book |
Suppress in OPAC |
Withdrawn status | Lost status | Damaged status | Use restrictions | Not for loan | Collection | Home library | Current library | Shelving location | Date acquired | Source of acquisition | Cost, normal purchase price | Total Checkouts | Full call number | Barcode | Date last seen | Price effective from | Koha item type | Public note |
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
e-Book For Access | Textbook | S. R. Ranganathan Learning Hub | S. R. Ranganathan Learning Hub | Online | 2022-09-20 | Infokart India Pvt. Ltd., New Delhi | 215.00 | 518.5 W676D | EB0408 | 2022-09-20 | 2022-09-20 | e-Book | Platform : Cambridge Core |