The Design of Approximation Algorithms / (Record no. 38483)
[ view plain ]
000 -LEADER | |
---|---|
fixed length control field | 02284nam a22003257a 4500 |
001 - CONTROL NUMBER | |
control field | sulb-eb0017045 |
003 - CONTROL NUMBER IDENTIFIER | |
control field | BD-SySUS |
005 - DATE AND TIME OF LATEST TRANSACTION | |
control field | 20160405140630.0 |
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
fixed length control field | 100927s2011||||enk o ||1 0|eng|d |
020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
International Standard Book Number | 9780511921735 (ebook) |
Canceled/invalid ISBN | 9780521195270 (hardback) |
040 ## - CATALOGING SOURCE | |
Original cataloging agency | UkCbUP |
Language of cataloging | eng |
Description conventions | rda |
Transcribing agency | UkCbUP |
Modifying agency | BD-SySUS. |
050 00 - LIBRARY OF CONGRESS CALL NUMBER | |
Classification number | QA221 |
Item number | .W55 2011 |
082 00 - DEWEY DECIMAL CLASSIFICATION NUMBER | |
Classification number | 518/.5 |
Edition number | 22 |
100 1# - MAIN ENTRY--PERSONAL NAME | |
Personal name | Williamson, David P., |
Relator term | author. |
245 14 - TITLE STATEMENT | |
Title | The Design of Approximation Algorithms / |
Statement of responsibility, etc. | David P. Williamson, David B. Shmoys. |
264 #1 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE | |
Place of production, publication, distribution, manufacture | Cambridge : |
Name of producer, publisher, distributor, manufacturer | Cambridge University Press, |
Date of production, publication, distribution, manufacture, or copyright notice | 2011. |
300 ## - PHYSICAL DESCRIPTION | |
Extent | 1 online resource (518 pages) : |
Other physical details | digital, PDF file(s). |
336 ## - CONTENT TYPE | |
Content type term | text |
Content type code | txt |
Source | rdacontent |
337 ## - MEDIA TYPE | |
Media type term | computer |
Media type code | c |
Source | rdamedia |
338 ## - CARRIER TYPE | |
Carrier type term | online resource |
Carrier type code | cr |
Source | rdacarrier |
500 ## - GENERAL NOTE | |
General note | Title from publisher's bibliographic system (viewed on 04 Apr 2016). |
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 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical term or geographic name as entry element | Approximation theory |
Topical term or geographic name as entry element | Mathematical optimization |
700 1# - ADDED ENTRY--PERSONAL NAME | |
Personal name | Shmoys, David B., |
Relator term | author. |
776 08 - ADDITIONAL PHYSICAL FORM ENTRY | |
Relationship information | Print version: |
International Standard Book Number | 9780521195270 |
856 40 - ELECTRONIC LOCATION AND ACCESS | |
Uniform Resource Identifier | <a href="http://dx.doi.org/10.1017/CBO9780511921735">http://dx.doi.org/10.1017/CBO9780511921735</a> |
942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
Source of classification or shelving scheme | |
Koha item type |
No items available.