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:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cambridge
Cambridge University Press
2011
|
| Schlagworte: | |
| Online-Zugang: | BSB01 FHN01 UPA01 Volltext |
| 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 |
| Beschreibung: | Title from publisher's bibliographic system (viewed on 05 Oct 2015) |
| Beschreibung: | 1 online resource (xi, 504 pages) |
| ISBN: | 9780511921735 |
| DOI: | 10.1017/CBO9780511921735 |
Internformat
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV043942713 | ||
| 003 | DE-604 | ||
| 005 | 20221121 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 161206s2011 |||| o||u| ||||||eng d | ||
| 020 | |a 9780511921735 |c Online |9 978-0-511-92173-5 | ||
| 024 | 7 | |a 10.1017/CBO9780511921735 |2 doi | |
| 035 | |a (ZDB-20-CBO)CR9780511921735 | ||
| 035 | |a (OCoLC)873896881 | ||
| 035 | |a (DE-599)BVBBV043942713 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 |a DE-92 |a DE-739 | ||
| 082 | 0 | |a 518/.5 |2 22 | |
| 084 | |a SK 905 |0 (DE-625)143269: |2 rvk | ||
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 100 | 1 | |a Williamson, David P. |d 1967- |e Verfasser |0 (DE-588)1013297776 |4 aut | |
| 245 | 1 | 0 | |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 resource (xi, 504 pages) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 500 | |a Title from publisher's bibliographic system (viewed on 05 Oct 2015) | ||
| 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 | ||
| 650 | 4 | |a Approximation theory | |
| 650 | 4 | |a Mathematical optimization | |
| 650 | 0 | 7 | |a Entwurf |0 (DE-588)4121208-3 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Optimierung |0 (DE-588)4043664-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Approximationsalgorithmus |0 (DE-588)4500954-5 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Optimierung |0 (DE-588)4043664-0 |D s |
| 689 | 0 | 1 | |a Approximationsalgorithmus |0 (DE-588)4500954-5 |D s |
| 689 | 0 | 2 | |a Entwurf |0 (DE-588)4121208-3 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Optimierung |0 (DE-588)4043664-0 |D s |
| 689 | 1 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 1 | 2 | |a Entwurf |0 (DE-588)4121208-3 |D s |
| 689 | 1 | |8 1\p |5 DE-604 | |
| 700 | 1 | |a Shmoys, David Bernard |d 1959- |e Sonstige |0 (DE-588)1013298829 |4 oth | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 978-0-521-19527-0 |
| 856 | 4 | 0 | |u https://doi.org/10.1017/CBO9780511921735 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-20-CBO | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-029351683 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 966 | e | |u https://doi.org/10.1017/CBO9780511921735 |l BSB01 |p ZDB-20-CBO |q BSB_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/CBO9780511921735 |l FHN01 |p ZDB-20-CBO |q FHN_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/CBO9780511921735 |l UPA01 |p ZDB-20-CBO |q UPA_PDA_CBO_Kauf2020 |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804176885937078272 |
|---|---|
| any_adam_object | |
| author | Williamson, David P. 1967- |
| author_GND | (DE-588)1013297776 (DE-588)1013298829 |
| author_facet | Williamson, David P. 1967- |
| author_role | aut |
| author_sort | Williamson, David P. 1967- |
| author_variant | d p w dp dpw |
| building | Verbundindex |
| bvnumber | BV043942713 |
| classification_rvk | SK 905 ST 134 |
| collection | ZDB-20-CBO |
| ctrlnum | (ZDB-20-CBO)CR9780511921735 (OCoLC)873896881 (DE-599)BVBBV043942713 |
| dewey-full | 518/.5 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 518 - Numerical analysis |
| dewey-raw | 518/.5 |
| dewey-search | 518/.5 |
| dewey-sort | 3518 15 |
| dewey-tens | 510 - Mathematics |
| discipline | Informatik Mathematik |
| doi_str_mv | 10.1017/CBO9780511921735 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03650nmm a2200601zc 4500</leader><controlfield tag="001">BV043942713</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20221121 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">161206s2011 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511921735</subfield><subfield code="c">Online</subfield><subfield code="9">978-0-511-92173-5</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1017/CBO9780511921735</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-20-CBO)CR9780511921735</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)873896881</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043942713</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-92</subfield><subfield code="a">DE-739</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">518/.5</subfield><subfield code="2">22</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 905</subfield><subfield code="0">(DE-625)143269:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 134</subfield><subfield code="0">(DE-625)143590:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Williamson, David P.</subfield><subfield code="d">1967-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1013297776</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><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 resource (xi, 504 pages)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Title from publisher's bibliographic system (viewed on 05 Oct 2015)</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="650" ind1=" " ind2="4"><subfield code="a">Approximation theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical optimization</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Entwurf</subfield><subfield code="0">(DE-588)4121208-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Optimierung</subfield><subfield code="0">(DE-588)4043664-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Approximationsalgorithmus</subfield><subfield code="0">(DE-588)4500954-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Optimierung</subfield><subfield code="0">(DE-588)4043664-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Approximationsalgorithmus</subfield><subfield code="0">(DE-588)4500954-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Entwurf</subfield><subfield code="0">(DE-588)4121208-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Optimierung</subfield><subfield code="0">(DE-588)4043664-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="2"><subfield code="a">Entwurf</subfield><subfield code="0">(DE-588)4121208-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Shmoys, David Bernard</subfield><subfield code="d">1959-</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)1013298829</subfield><subfield code="4">oth</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">978-0-521-19527-0</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1017/CBO9780511921735</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CBO</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-029351683</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9780511921735</subfield><subfield code="l">BSB01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">BSB_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9780511921735</subfield><subfield code="l">FHN01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">FHN_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9780511921735</subfield><subfield code="l">UPA01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">UPA_PDA_CBO_Kauf2020</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV043942713 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T07:39:18Z |
| institution | BVB |
| isbn | 9780511921735 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-029351683 |
| oclc_num | 873896881 |
| open_access_boolean | |
| owner | DE-12 DE-92 DE-739 |
| owner_facet | DE-12 DE-92 DE-739 |
| physical | 1 online resource (xi, 504 pages) |
| psigel | ZDB-20-CBO ZDB-20-CBO BSB_PDA_CBO ZDB-20-CBO FHN_PDA_CBO ZDB-20-CBO UPA_PDA_CBO_Kauf2020 |
| publishDate | 2011 |
| publishDateSearch | 2011 |
| publishDateSort | 2011 |
| publisher | Cambridge University Press |
| record_format | marc |
| spelling | Williamson, David P. 1967- Verfasser (DE-588)1013297776 aut The design of approximation algorithms David P. Williamson, David B. Shmoys Cambridge Cambridge University Press 2011 1 online resource (xi, 504 pages) txt rdacontent c rdamedia cr rdacarrier Title from publisher's bibliographic system (viewed on 05 Oct 2015) 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 Approximation theory Mathematical optimization Entwurf (DE-588)4121208-3 gnd rswk-swf Optimierung (DE-588)4043664-0 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Approximationsalgorithmus (DE-588)4500954-5 gnd rswk-swf Optimierung (DE-588)4043664-0 s Approximationsalgorithmus (DE-588)4500954-5 s Entwurf (DE-588)4121208-3 s DE-604 Algorithmus (DE-588)4001183-5 s 1\p DE-604 Shmoys, David Bernard 1959- Sonstige (DE-588)1013298829 oth Erscheint auch als Druck-Ausgabe 978-0-521-19527-0 https://doi.org/10.1017/CBO9780511921735 Verlag URL des Erstveröffentlichers Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Williamson, David P. 1967- The design of approximation algorithms Approximation theory Mathematical optimization Entwurf (DE-588)4121208-3 gnd Optimierung (DE-588)4043664-0 gnd Algorithmus (DE-588)4001183-5 gnd Approximationsalgorithmus (DE-588)4500954-5 gnd |
| subject_GND | (DE-588)4121208-3 (DE-588)4043664-0 (DE-588)4001183-5 (DE-588)4500954-5 |
| 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 | the design of approximation algorithms |
| topic | Approximation theory Mathematical optimization Entwurf (DE-588)4121208-3 gnd Optimierung (DE-588)4043664-0 gnd Algorithmus (DE-588)4001183-5 gnd Approximationsalgorithmus (DE-588)4500954-5 gnd |
| topic_facet | Approximation theory Mathematical optimization Entwurf Optimierung Algorithmus Approximationsalgorithmus |
| url | https://doi.org/10.1017/CBO9780511921735 |
| work_keys_str_mv | AT williamsondavidp thedesignofapproximationalgorithms AT shmoysdavidbernard thedesignofapproximationalgorithms |