The design of approximation algorithms:
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 algorith...
Gespeichert in:
| Beteilige Person: | |
|---|---|
| Weitere beteiligte Personen: | |
| Format: | E-Book |
| Sprache: | Englisch |
| Veröffentlicht: |
Cambridge
Cambridge University Press
2011
|
| Links: | https://doi.org/10.1017/CBO9780511921735 |
| Zusammenfassung: | 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. |
| Umfang: | 1 Online-Ressource (xi, 504 Seiten) |
| ISBN: | 9780511921735 |
Internformat
MARC
| LEADER | 00000nam a2200000 i 4500 | ||
|---|---|---|---|
| 001 | ZDB-20-CTM-CR9780511921735 | ||
| 003 | UkCbUP | ||
| 005 | 20151005020624.0 | ||
| 006 | m|||||o||d|||||||| | ||
| 007 | cr|||||||||||| | ||
| 008 | 100927s2011||||enk o ||1 0|eng|d | ||
| 020 | |a 9780511921735 | ||
| 100 | 1 | |a Williamson, David P. | |
| 245 | 1 | 4 | |a The design of approximation algorithms |c David P. Williamson, David B. Shmoys |
| 264 | 1 | |a Cambridge |b Cambridge University Press |c 2011 | |
| 300 | |a 1 Online-Ressource (xi, 504 Seiten) | ||
| 336 | |b txt | ||
| 337 | |b c | ||
| 338 | |b cr | ||
| 520 | |a 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. | ||
| 700 | 1 | |a Shmoys, David Bernard | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9780521195270 |
| 966 | 4 | 0 | |l DE-91 |p ZDB-20-CTM |q TUM_PDA_CTM |u https://doi.org/10.1017/CBO9780511921735 |3 Volltext |
| 912 | |a ZDB-20-CTM | ||
| 912 | |a ZDB-20-CTM | ||
| 049 | |a DE-91 | ||
Datensatz im Suchindex
| DE-BY-TUM_katkey | ZDB-20-CTM-CR9780511921735 |
|---|---|
| _version_ | 1825574050994323456 |
| adam_text | |
| any_adam_object | |
| author | Williamson, David P. |
| author2 | Shmoys, David Bernard |
| author2_role | |
| author2_variant | d b s db dbs |
| author_facet | Williamson, David P. Shmoys, David Bernard |
| author_role | |
| author_sort | Williamson, David P. |
| author_variant | d p w dp dpw |
| building | Verbundindex |
| bvnumber | localTUM |
| collection | ZDB-20-CTM |
| format | eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01869nam a2200253 i 4500</leader><controlfield tag="001">ZDB-20-CTM-CR9780511921735</controlfield><controlfield tag="003">UkCbUP</controlfield><controlfield tag="005">20151005020624.0</controlfield><controlfield tag="006">m|||||o||d||||||||</controlfield><controlfield tag="007">cr||||||||||||</controlfield><controlfield tag="008">100927s2011||||enk o ||1 0|eng|d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511921735</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Williamson, David P.</subfield></datafield><datafield tag="245" ind1="1" ind2="4"><subfield code="a">The design of approximation algorithms</subfield><subfield code="c">David P. Williamson, David B. Shmoys</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">2011</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (xi, 504 Seiten)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">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.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Shmoys, David Bernard</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9780521195270</subfield></datafield><datafield tag="966" ind1="4" ind2="0"><subfield code="l">DE-91</subfield><subfield code="p">ZDB-20-CTM</subfield><subfield code="q">TUM_PDA_CTM</subfield><subfield code="u">https://doi.org/10.1017/CBO9780511921735</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CTM</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CTM</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield></datafield></record></collection> |
| id | ZDB-20-CTM-CR9780511921735 |
| illustrated | Not Illustrated |
| indexdate | 2025-03-03T11:58:05Z |
| institution | BVB |
| isbn | 9780511921735 |
| language | English |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM |
| owner_facet | DE-91 DE-BY-TUM |
| physical | 1 Online-Ressource (xi, 504 Seiten) |
| psigel | ZDB-20-CTM TUM_PDA_CTM ZDB-20-CTM |
| publishDate | 2011 |
| publishDateSearch | 2011 |
| publishDateSort | 2011 |
| publisher | Cambridge University Press |
| record_format | marc |
| spelling | Williamson, David P. The design of approximation algorithms David P. Williamson, David B. Shmoys Cambridge Cambridge University Press 2011 1 Online-Ressource (xi, 504 Seiten) txt c cr 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. Shmoys, David Bernard Erscheint auch als Druck-Ausgabe 9780521195270 |
| spellingShingle | Williamson, David P. The design of approximation algorithms |
| title | The design of approximation algorithms |
| title_auth | The design of approximation algorithms |
| title_exact_search | The design of approximation algorithms |
| title_full | The design of approximation algorithms David P. Williamson, David B. Shmoys |
| title_fullStr | The design of approximation algorithms David P. Williamson, David B. Shmoys |
| title_full_unstemmed | The design of approximation algorithms David P. Williamson, David B. Shmoys |
| title_short | The design of approximation algorithms |
| title_sort | design of approximation algorithms |
| work_keys_str_mv | AT williamsondavidp thedesignofapproximationalgorithms AT shmoysdavidbernard thedesignofapproximationalgorithms AT williamsondavidp designofapproximationalgorithms AT shmoysdavidbernard designofapproximationalgorithms |