The design of approximation algorithms /:
"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...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Weitere Verfasser: | |
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cambridge ; New York :
Cambridge University Press,
©2011.
|
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Zusammenfassung: | "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"-- |
| Beschreibung: | 1 online resource (xi, 504 pages) : illustrations |
| Bibliographie: | Includes bibliographical references and indexes. |
| ISBN: | 9781139077750 1139077759 9781139080040 1139080040 9780511921735 051192173X 1107214513 9781107214514 1283110962 9781283110969 1139075497 9781139075497 9786613110961 6613110965 1139082310 9781139082310 |
Internformat
MARC
| LEADER | 00000cam a2200000 a 4500 | ||
|---|---|---|---|
| 001 | ZDB-4-EBA-ocn727950679 | ||
| 003 | OCoLC | ||
| 005 | 20241004212047.0 | ||
| 006 | m o d | ||
| 007 | cr mnu---unuuu | ||
| 008 | 110601s2011 enka ob 001 0 eng d | ||
| 040 | |a N$T |b eng |e pn |c N$T |d E7B |d CDX |d OTZ |d OSU |d UKMGB |d OSU |d OCLCQ |d REDDC |d OCLCQ |d YDXCP |d OCLCF |d CAMBR |d COO |d OCLCQ |d HEBIS |d OCLCQ |d UAB |d OCLCQ |d AU@ |d OCLCQ |d K6U |d OCLCO |d LUN |d AUD |d UKAHL |d QGK |d OCLCO |d OCLCQ |d S9M |d OCLCQ |d OCLCL |d SFB | ||
| 016 | 7 | |a 015663940 |2 Uk | |
| 019 | |a 817914032 |a 960495272 |a 960738823 |a 978658536 |a 978904795 |a 1170757589 |a 1173702945 |a 1259136326 | ||
| 020 | |a 9781139077750 |q (electronic bk.) | ||
| 020 | |a 1139077759 |q (electronic bk.) | ||
| 020 | |a 9781139080040 |q (electronic bk.) | ||
| 020 | |a 1139080040 |q (electronic bk.) | ||
| 020 | |z 9780521195270 |q (hardback) | ||
| 020 | |z 0521195276 |q (hardback) | ||
| 020 | |a 9780511921735 |q (ebook) | ||
| 020 | |a 051192173X | ||
| 020 | |a 1107214513 | ||
| 020 | |a 9781107214514 | ||
| 020 | |a 1283110962 | ||
| 020 | |a 9781283110969 | ||
| 020 | |a 1139075497 | ||
| 020 | |a 9781139075497 | ||
| 020 | |a 9786613110961 | ||
| 020 | |a 6613110965 | ||
| 020 | |a 1139082310 | ||
| 020 | |a 9781139082310 | ||
| 035 | |a (OCoLC)727950679 |z (OCoLC)817914032 |z (OCoLC)960495272 |z (OCoLC)960738823 |z (OCoLC)978658536 |z (OCoLC)978904795 |z (OCoLC)1170757589 |z (OCoLC)1173702945 |z (OCoLC)1259136326 | ||
| 050 | 4 | |a QA221 |b .W55 2011eb | |
| 072 | 7 | |a MAT |x 041000 |2 bisacsh | |
| 082 | 7 | |a 518/.5 |2 22 | |
| 084 | |a COM051300 |2 bisacsh | ||
| 049 | |a MAIN | ||
| 100 | 1 | |a Williamson, David P. |0 http://id.loc.gov/authorities/names/nb2007016384 | |
| 245 | 1 | 4 | |a The design of approximation algorithms / |c David P. Williamson, David B. Shmoys. |
| 260 | |a Cambridge ; |a New York : |b Cambridge University Press, |c ©2011. | ||
| 300 | |a 1 online resource (xi, 504 pages) : |b illustrations | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 520 | |a "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"-- |c Provided by publisher. | ||
| 504 | |a Includes bibliographical references and indexes. | ||
| 505 | 0 | |a An introduction to the techniques. An introduction to approximation algorithms -- Greedy algorithms and local search -- Rounding data and dynamic programming -- Deterministic rounding of linear programs -- Random sampling and randomized rounding of linear programs -- Randomized rounding of semidefinite programs -- The primal-dual method -- Cuts and metrics -- Further uses of the techniques. Further uses of greedy and local search algorithms -- Further uses of rounding data and dynamic programming -- Further uses of deterministic rounding of linear programs -- Further uses of random sampling and randomized rounding of linear programs -- Further uses of randomized rounding of semidefinite programs -- Further uses of the primal-dual method -- Further uses of cuts and metrics -- Techniques in proving the hardness of approximation -- Open problems -- Appendix A: Linear programming -- Appendix B: NP-completeness. | |
| 588 | 0 | |a Print version record. | |
| 546 | |a English. | ||
| 650 | 0 | |a Approximation theory. |0 http://id.loc.gov/authorities/subjects/sh85006190 | |
| 650 | 0 | |a Mathematical optimization. |0 http://id.loc.gov/authorities/subjects/sh85082127 | |
| 650 | 6 | |a Théorie de l'approximation. | |
| 650 | 6 | |a Optimisation mathématique. | |
| 650 | 7 | |a COMPUTERS |x Programming |x Algorithms. |2 bisacsh | |
| 650 | 7 | |a MATHEMATICS |x Numerical Analysis. |2 bisacsh | |
| 650 | 7 | |a Análisis numérico |2 embne | |
| 650 | 7 | |a Algoritmos |2 embne | |
| 650 | 0 | 7 | |a Programación |2 embucm |
| 650 | 7 | |a Approximation theory |2 fast | |
| 650 | 7 | |a Mathematical optimization |2 fast | |
| 650 | 7 | |a Algorithmus |2 gnd |0 http://d-nb.info/gnd/4001183-5 | |
| 650 | 7 | |a Approximationstheorie |2 gnd |0 http://d-nb.info/gnd/4120913-8 | |
| 655 | 0 | |a Electronic books. | |
| 655 | 4 | |a Electronic books. | |
| 700 | 1 | |a Shmoys, David Bernard. |0 http://id.loc.gov/authorities/names/n86840752 | |
| 758 | |i has work: |a The design of approximation algorithms (Text) |1 https://id.oclc.org/worldcat/entity/E39PCGk9xHrTPPrjK6VVHpPpHd |4 https://id.oclc.org/worldcat/ontology/hasWork | ||
| 776 | 0 | 8 | |i Print version: |a Williamson, David P. |t Design of approximation algorithms. |d New York : Cambridge University Press, 2011 |z 9780521195270 |w (DLC) 2011001945 |w (OCoLC)671709856 |
| 856 | 4 | 0 | |l FWS01 |p ZDB-4-EBA |q FWS_PDA_EBA |u https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=366275 |3 Volltext |
| 938 | |a Coutts Information Services |b COUT |n 17930550 | ||
| 938 | |a ebrary |b EBRY |n ebr10470771 | ||
| 938 | |a EBSCOhost |b EBSC |n 366275 | ||
| 938 | |a YBP Library Services |b YANK |n 6898349 | ||
| 938 | |a YBP Library Services |b YANK |n 9247953 | ||
| 938 | |a YBP Library Services |b YANK |n 6918193 | ||
| 938 | |a Askews and Holts Library Services |b ASKH |n AH22948727 | ||
| 994 | |a 92 |b GEBAY | ||
| 912 | |a ZDB-4-EBA | ||
| 049 | |a DE-863 | ||
Datensatz im Suchindex
| DE-BY-FWS_katkey | ZDB-4-EBA-ocn727950679 |
|---|---|
| _version_ | 1816881760541081600 |
| adam_text | |
| any_adam_object | |
| author | Williamson, David P. |
| author2 | Shmoys, David Bernard |
| author2_role | |
| author2_variant | d b s db dbs |
| author_GND | http://id.loc.gov/authorities/names/nb2007016384 http://id.loc.gov/authorities/names/n86840752 |
| 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 | localFWS |
| callnumber-first | Q - Science |
| callnumber-label | QA221 |
| callnumber-raw | QA221 .W55 2011eb |
| callnumber-search | QA221 .W55 2011eb |
| callnumber-sort | QA 3221 W55 42011EB |
| callnumber-subject | QA - Mathematics |
| collection | ZDB-4-EBA |
| contents | An introduction to the techniques. An introduction to approximation algorithms -- Greedy algorithms and local search -- Rounding data and dynamic programming -- Deterministic rounding of linear programs -- Random sampling and randomized rounding of linear programs -- Randomized rounding of semidefinite programs -- The primal-dual method -- Cuts and metrics -- Further uses of the techniques. Further uses of greedy and local search algorithms -- Further uses of rounding data and dynamic programming -- Further uses of deterministic rounding of linear programs -- Further uses of random sampling and randomized rounding of linear programs -- Further uses of randomized rounding of semidefinite programs -- Further uses of the primal-dual method -- Further uses of cuts and metrics -- Techniques in proving the hardness of approximation -- Open problems -- Appendix A: Linear programming -- Appendix B: NP-completeness. |
| ctrlnum | (OCoLC)727950679 |
| 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 | Mathematik |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>06084cam a2200889 a 4500</leader><controlfield tag="001">ZDB-4-EBA-ocn727950679</controlfield><controlfield tag="003">OCoLC</controlfield><controlfield tag="005">20241004212047.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr mnu---unuuu</controlfield><controlfield tag="008">110601s2011 enka ob 001 0 eng d</controlfield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">N$T</subfield><subfield code="b">eng</subfield><subfield code="e">pn</subfield><subfield code="c">N$T</subfield><subfield code="d">E7B</subfield><subfield code="d">CDX</subfield><subfield code="d">OTZ</subfield><subfield code="d">OSU</subfield><subfield code="d">UKMGB</subfield><subfield code="d">OSU</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">REDDC</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">YDXCP</subfield><subfield code="d">OCLCF</subfield><subfield code="d">CAMBR</subfield><subfield code="d">COO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">HEBIS</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">UAB</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">AU@</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">K6U</subfield><subfield code="d">OCLCO</subfield><subfield code="d">LUN</subfield><subfield code="d">AUD</subfield><subfield code="d">UKAHL</subfield><subfield code="d">QGK</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">S9M</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCL</subfield><subfield code="d">SFB</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">015663940</subfield><subfield code="2">Uk</subfield></datafield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">817914032</subfield><subfield code="a">960495272</subfield><subfield code="a">960738823</subfield><subfield code="a">978658536</subfield><subfield code="a">978904795</subfield><subfield code="a">1170757589</subfield><subfield code="a">1173702945</subfield><subfield code="a">1259136326</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781139077750</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1139077759</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781139080040</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1139080040</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9780521195270</subfield><subfield code="q">(hardback)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">0521195276</subfield><subfield code="q">(hardback)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511921735</subfield><subfield code="q">(ebook)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">051192173X</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1107214513</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781107214514</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1283110962</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781283110969</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1139075497</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781139075497</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9786613110961</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">6613110965</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1139082310</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781139082310</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)727950679</subfield><subfield code="z">(OCoLC)817914032</subfield><subfield code="z">(OCoLC)960495272</subfield><subfield code="z">(OCoLC)960738823</subfield><subfield code="z">(OCoLC)978658536</subfield><subfield code="z">(OCoLC)978904795</subfield><subfield code="z">(OCoLC)1170757589</subfield><subfield code="z">(OCoLC)1173702945</subfield><subfield code="z">(OCoLC)1259136326</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA221</subfield><subfield code="b">.W55 2011eb</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">MAT</subfield><subfield code="x">041000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="082" ind1="7" ind2=" "><subfield code="a">518/.5</subfield><subfield code="2">22</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">COM051300</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">MAIN</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Williamson, David P.</subfield><subfield code="0">http://id.loc.gov/authorities/names/nb2007016384</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="260" ind1=" " ind2=" "><subfield code="a">Cambridge ;</subfield><subfield code="a">New York :</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><subfield code="b">illustrations</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">"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"--</subfield><subfield code="c">Provided by publisher.</subfield></datafield><datafield tag="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and indexes.</subfield></datafield><datafield tag="505" ind1="0" ind2=" "><subfield code="a">An introduction to the techniques. An introduction to approximation algorithms -- Greedy algorithms and local search -- Rounding data and dynamic programming -- Deterministic rounding of linear programs -- Random sampling and randomized rounding of linear programs -- Randomized rounding of semidefinite programs -- The primal-dual method -- Cuts and metrics -- Further uses of the techniques. Further uses of greedy and local search algorithms -- Further uses of rounding data and dynamic programming -- Further uses of deterministic rounding of linear programs -- Further uses of random sampling and randomized rounding of linear programs -- Further uses of randomized rounding of semidefinite programs -- Further uses of the primal-dual method -- Further uses of cuts and metrics -- Techniques in proving the hardness of approximation -- Open problems -- Appendix A: Linear programming -- Appendix B: NP-completeness.</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Print version record.</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">English.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Approximation theory.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85006190</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Mathematical optimization.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85082127</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Théorie de l'approximation.</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Optimisation mathématique.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS</subfield><subfield code="x">Programming</subfield><subfield code="x">Algorithms.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS</subfield><subfield code="x">Numerical Analysis.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Análisis numérico</subfield><subfield code="2">embne</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algoritmos</subfield><subfield code="2">embne</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Programación</subfield><subfield code="2">embucm</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Approximation theory</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Mathematical optimization</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="2">gnd</subfield><subfield code="0">http://d-nb.info/gnd/4001183-5</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Approximationstheorie</subfield><subfield code="2">gnd</subfield><subfield code="0">http://d-nb.info/gnd/4120913-8</subfield></datafield><datafield tag="655" ind1=" " ind2="0"><subfield code="a">Electronic books.</subfield></datafield><datafield tag="655" ind1=" " ind2="4"><subfield code="a">Electronic books.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Shmoys, David Bernard.</subfield><subfield code="0">http://id.loc.gov/authorities/names/n86840752</subfield></datafield><datafield tag="758" ind1=" " ind2=" "><subfield code="i">has work:</subfield><subfield code="a">The design of approximation algorithms (Text)</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PCGk9xHrTPPrjK6VVHpPpHd</subfield><subfield code="4">https://id.oclc.org/worldcat/ontology/hasWork</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Print version:</subfield><subfield code="a">Williamson, David P.</subfield><subfield code="t">Design of approximation algorithms.</subfield><subfield code="d">New York : Cambridge University Press, 2011</subfield><subfield code="z">9780521195270</subfield><subfield code="w">(DLC) 2011001945</subfield><subfield code="w">(OCoLC)671709856</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="l">FWS01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FWS_PDA_EBA</subfield><subfield code="u">https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=366275</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Coutts Information Services</subfield><subfield code="b">COUT</subfield><subfield code="n">17930550</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ebrary</subfield><subfield code="b">EBRY</subfield><subfield code="n">ebr10470771</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBSCOhost</subfield><subfield code="b">EBSC</subfield><subfield code="n">366275</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">6898349</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">9247953</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">6918193</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Askews and Holts Library Services</subfield><subfield code="b">ASKH</subfield><subfield code="n">AH22948727</subfield></datafield><datafield tag="994" ind1=" " ind2=" "><subfield code="a">92</subfield><subfield code="b">GEBAY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-EBA</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-863</subfield></datafield></record></collection> |
| genre | Electronic books. |
| genre_facet | Electronic books. |
| id | ZDB-4-EBA-ocn727950679 |
| illustrated | Illustrated |
| indexdate | 2024-11-27T13:17:50Z |
| institution | BVB |
| isbn | 9781139077750 1139077759 9781139080040 1139080040 9780511921735 051192173X 1107214513 9781107214514 1283110962 9781283110969 1139075497 9781139075497 9786613110961 6613110965 1139082310 9781139082310 |
| language | English |
| oclc_num | 727950679 |
| open_access_boolean | |
| owner | MAIN DE-863 DE-BY-FWS |
| owner_facet | MAIN DE-863 DE-BY-FWS |
| physical | 1 online resource (xi, 504 pages) : illustrations |
| psigel | ZDB-4-EBA |
| publishDate | 2011 |
| publishDateSearch | 2011 |
| publishDateSort | 2011 |
| publisher | Cambridge University Press, |
| record_format | marc |
| spelling | Williamson, David P. http://id.loc.gov/authorities/names/nb2007016384 The design of approximation algorithms / David P. Williamson, David B. Shmoys. Cambridge ; New York : Cambridge University Press, ©2011. 1 online resource (xi, 504 pages) : illustrations text txt rdacontent computer c rdamedia online resource cr rdacarrier "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"-- Provided by publisher. Includes bibliographical references and indexes. An introduction to the techniques. An introduction to approximation algorithms -- Greedy algorithms and local search -- Rounding data and dynamic programming -- Deterministic rounding of linear programs -- Random sampling and randomized rounding of linear programs -- Randomized rounding of semidefinite programs -- The primal-dual method -- Cuts and metrics -- Further uses of the techniques. Further uses of greedy and local search algorithms -- Further uses of rounding data and dynamic programming -- Further uses of deterministic rounding of linear programs -- Further uses of random sampling and randomized rounding of linear programs -- Further uses of randomized rounding of semidefinite programs -- Further uses of the primal-dual method -- Further uses of cuts and metrics -- Techniques in proving the hardness of approximation -- Open problems -- Appendix A: Linear programming -- Appendix B: NP-completeness. Print version record. English. Approximation theory. http://id.loc.gov/authorities/subjects/sh85006190 Mathematical optimization. http://id.loc.gov/authorities/subjects/sh85082127 Théorie de l'approximation. Optimisation mathématique. COMPUTERS Programming Algorithms. bisacsh MATHEMATICS Numerical Analysis. bisacsh Análisis numérico embne Algoritmos embne Programación embucm Approximation theory fast Mathematical optimization fast Algorithmus gnd http://d-nb.info/gnd/4001183-5 Approximationstheorie gnd http://d-nb.info/gnd/4120913-8 Electronic books. Shmoys, David Bernard. http://id.loc.gov/authorities/names/n86840752 has work: The design of approximation algorithms (Text) https://id.oclc.org/worldcat/entity/E39PCGk9xHrTPPrjK6VVHpPpHd https://id.oclc.org/worldcat/ontology/hasWork Print version: Williamson, David P. Design of approximation algorithms. New York : Cambridge University Press, 2011 9780521195270 (DLC) 2011001945 (OCoLC)671709856 FWS01 ZDB-4-EBA FWS_PDA_EBA https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=366275 Volltext |
| spellingShingle | Williamson, David P. The design of approximation algorithms / An introduction to the techniques. An introduction to approximation algorithms -- Greedy algorithms and local search -- Rounding data and dynamic programming -- Deterministic rounding of linear programs -- Random sampling and randomized rounding of linear programs -- Randomized rounding of semidefinite programs -- The primal-dual method -- Cuts and metrics -- Further uses of the techniques. Further uses of greedy and local search algorithms -- Further uses of rounding data and dynamic programming -- Further uses of deterministic rounding of linear programs -- Further uses of random sampling and randomized rounding of linear programs -- Further uses of randomized rounding of semidefinite programs -- Further uses of the primal-dual method -- Further uses of cuts and metrics -- Techniques in proving the hardness of approximation -- Open problems -- Appendix A: Linear programming -- Appendix B: NP-completeness. Approximation theory. http://id.loc.gov/authorities/subjects/sh85006190 Mathematical optimization. http://id.loc.gov/authorities/subjects/sh85082127 Théorie de l'approximation. Optimisation mathématique. COMPUTERS Programming Algorithms. bisacsh MATHEMATICS Numerical Analysis. bisacsh Análisis numérico embne Algoritmos embne Programación embucm Approximation theory fast Mathematical optimization fast Algorithmus gnd http://d-nb.info/gnd/4001183-5 Approximationstheorie gnd http://d-nb.info/gnd/4120913-8 |
| subject_GND | http://id.loc.gov/authorities/subjects/sh85006190 http://id.loc.gov/authorities/subjects/sh85082127 http://d-nb.info/gnd/4001183-5 http://d-nb.info/gnd/4120913-8 |
| 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 |
| topic | Approximation theory. http://id.loc.gov/authorities/subjects/sh85006190 Mathematical optimization. http://id.loc.gov/authorities/subjects/sh85082127 Théorie de l'approximation. Optimisation mathématique. COMPUTERS Programming Algorithms. bisacsh MATHEMATICS Numerical Analysis. bisacsh Análisis numérico embne Algoritmos embne Programación embucm Approximation theory fast Mathematical optimization fast Algorithmus gnd http://d-nb.info/gnd/4001183-5 Approximationstheorie gnd http://d-nb.info/gnd/4120913-8 |
| topic_facet | Approximation theory. Mathematical optimization. Théorie de l'approximation. Optimisation mathématique. COMPUTERS Programming Algorithms. MATHEMATICS Numerical Analysis. Análisis numérico Algoritmos Programación Approximation theory Mathematical optimization Algorithmus Approximationstheorie Electronic books. |
| url | https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=366275 |
| work_keys_str_mv | AT williamsondavidp thedesignofapproximationalgorithms AT shmoysdavidbernard thedesignofapproximationalgorithms AT williamsondavidp designofapproximationalgorithms AT shmoysdavidbernard designofapproximationalgorithms |