Approximation algorithms:
This book covers the dominant theoretical approaches to the approximate solution of hard combinatorial optimization and enumeration problems. It contains elegant combinatorial theory, useful and interesting algorithms, and deep results about the intrinsic complexity of combinatorial problems. Its cl...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Berlin ; Heidelberg
Springer
2003
|
| Ausgabe: | corrected second printing |
| Schlagworte: | |
| Online-Zugang: | DE-91 DE-91G DE-473 DE-706 DE-739 Volltext |
| Zusammenfassung: | This book covers the dominant theoretical approaches to the approximate solution of hard combinatorial optimization and enumeration problems. It contains elegant combinatorial theory, useful and interesting algorithms, and deep results about the intrinsic complexity of combinatorial problems. Its clarity of exposition and excellent selection of exercises will make it accessible and appealing to all those with a taste for mathematics and algorithms. Richard Karp,University Professor, University of California at Berkeley Following the development of basic combinatorial optimization techniques in the 1960s and 1970s, a main open question was to develop a theory of approximation algorithms. In the 1990s, parallel developments in techniques for designing approximation algorithms as well as methods for proving hardness of approximation results have led to a beautiful theory. The need to solve truly large instances of computationally hard problems, such as those arising from the Internet or the human genome project, has also increased interest in this theory. The field is currently very active, with the toolbox of approximation algorithm design techniques getting always richer. It is a pleasure to recommend Vijay Vazirani's well-written and comprehensive book on this important and timely topic. I am sure the reader will find it most useful both as an introduction to approximability as well as a reference to the many aspects of approximation algorithms. László Lovász, Senior Researcher, Microsoft Research |
| Beschreibung: | 1 Online-Ressource (XIX, 380 Seiten) Illustrationen |
| ISBN: | 9783662045657 |
| DOI: | 10.1007/978-3-662-04565-7 |
Internformat
MARC
| LEADER | 00000nam a22000001c 4500 | ||
|---|---|---|---|
| 001 | BV046672238 | ||
| 003 | DE-604 | ||
| 005 | 20240206 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 200415s2003 gw a||| o|||| 00||| eng d | ||
| 020 | |a 9783662045657 |c Online |9 978-3-662-04565-7 | ||
| 024 | 7 | |a 10.1007/978-3-662-04565-7 |2 doi | |
| 035 | |a (ZDB-30-PQE)EBC3097734 | ||
| 035 | |a (OCoLC)1152240922 | ||
| 035 | |a (DE-599)GBV748937315 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c XA-DE | ||
| 049 | |a DE-91G |a DE-706 |a DE-473 |a DE-739 | ||
| 050 | 0 | |a QA76.9.A43 | |
| 082 | 0 | |a 005.1 |2 23 | |
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 084 | |a ST 600 |0 (DE-625)143681: |2 rvk | ||
| 084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
| 084 | |a MAT 913f |2 stub | ||
| 084 | |a DAT 530f |2 stub | ||
| 100 | 1 | |a Vazirani, Vijay V. |d 1957- |e Verfasser |0 (DE-588)122932196 |4 aut | |
| 245 | 1 | 0 | |a Approximation algorithms |c Vijay V. Vazirani |
| 250 | |a corrected second printing | ||
| 264 | 1 | |a Berlin ; Heidelberg |b Springer |c 2003 | |
| 300 | |a 1 Online-Ressource (XIX, 380 Seiten) |b Illustrationen | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 520 | 3 | |a This book covers the dominant theoretical approaches to the approximate solution of hard combinatorial optimization and enumeration problems. It contains elegant combinatorial theory, useful and interesting algorithms, and deep results about the intrinsic complexity of combinatorial problems. Its clarity of exposition and excellent selection of exercises will make it accessible and appealing to all those with a taste for mathematics and algorithms. Richard Karp,University Professor, University of California at Berkeley Following the development of basic combinatorial optimization techniques in the 1960s and 1970s, a main open question was to develop a theory of approximation algorithms. In the 1990s, parallel developments in techniques for designing approximation algorithms as well as methods for proving hardness of approximation results have led to a beautiful theory. The need to solve truly large instances of computationally hard problems, such as those arising from the Internet or the human genome project, has also increased interest in this theory. The field is currently very active, with the toolbox of approximation algorithm design techniques getting always richer. It is a pleasure to recommend Vijay Vazirani's well-written and comprehensive book on this important and timely topic. I am sure the reader will find it most useful both as an introduction to approximability as well as a reference to the many aspects of approximation algorithms. László Lovász, Senior Researcher, Microsoft Research | |
| 650 | 0 | 7 | |a Approximationsalgorithmus |0 (DE-588)4500954-5 |2 gnd |9 rswk-swf |
| 653 | 0 | |a Computer science | |
| 653 | 0 | |a Computer software | |
| 653 | 0 | |a Electronic data processing | |
| 653 | 0 | |a Computational complexity | |
| 653 | 0 | |a Combinatorics | |
| 653 | 0 | |a Operations research | |
| 689 | 0 | 0 | |a Approximationsalgorithmus |0 (DE-588)4500954-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 978-3-642-08469-0 |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-3-662-04565-7 |x Resolving-System |3 Volltext |
| 912 | |a ZDB-30-PQE | ||
| 912 | |a ZDB-2-BAE | ||
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-032083217 | |
| 966 | e | |u https://ebookcentral.proquest.com/lib/munchentech/detail.action?docID=3097734 |l DE-91 |p ZDB-30-PQE |q TUM_Einzelkauf |x Agregator |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-662-04565-7 |l DE-91G |p ZDB-30-PQE |x Resolving-System |3 Volltext | |
| 966 | e | |u https://ebookcentral.proquest.com/lib/ub-bamberg/detail.action?docID=3097734 |l DE-473 |p ZDB-30-PQE |q UBG_Einzelkauf |x Agregator |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-662-04565-7 |l DE-706 |p ZDB-30-PQE |x Resolving-System |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-662-04565-7 |l DE-739 |p ZDB-2-BAE |q UPA_Einzelkauf_2024 |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1815499176016871424 |
|---|---|
| adam_text | |
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Vazirani, Vijay V. 1957- |
| author_GND | (DE-588)122932196 |
| author_facet | Vazirani, Vijay V. 1957- |
| author_role | aut |
| author_sort | Vazirani, Vijay V. 1957- |
| author_variant | v v v vv vvv |
| building | Verbundindex |
| bvnumber | BV046672238 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.9.A43 |
| callnumber-search | QA76.9.A43 |
| callnumber-sort | QA 276.9 A43 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 134 ST 600 SK 890 |
| classification_tum | MAT 913f DAT 530f |
| collection | ZDB-30-PQE ZDB-2-BAE |
| ctrlnum | (ZDB-30-PQE)EBC3097734 (OCoLC)1152240922 (DE-599)GBV748937315 |
| dewey-full | 005.1 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.1 |
| dewey-search | 005.1 |
| dewey-sort | 15.1 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik Mathematik |
| discipline_str_mv | Informatik Mathematik |
| doi_str_mv | 10.1007/978-3-662-04565-7 |
| edition | corrected second printing |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a22000001c 4500</leader><controlfield tag="001">BV046672238</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20240206</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">200415s2003 gw a||| o|||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783662045657</subfield><subfield code="c">Online</subfield><subfield code="9">978-3-662-04565-7</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-3-662-04565-7</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-30-PQE)EBC3097734</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1152240922</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBV748937315</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="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">XA-DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-473</subfield><subfield code="a">DE-739</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.9.A43</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.1</subfield><subfield code="2">23</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="084" ind1=" " ind2=" "><subfield code="a">ST 600</subfield><subfield code="0">(DE-625)143681:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 890</subfield><subfield code="0">(DE-625)143267:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 913f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 530f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Vazirani, Vijay V.</subfield><subfield code="d">1957-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)122932196</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Approximation algorithms</subfield><subfield code="c">Vijay V. Vazirani</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">corrected second printing</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin ; Heidelberg</subfield><subfield code="b">Springer</subfield><subfield code="c">2003</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XIX, 380 Seiten)</subfield><subfield code="b">Illustrationen</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="520" ind1="3" ind2=" "><subfield code="a">This book covers the dominant theoretical approaches to the approximate solution of hard combinatorial optimization and enumeration problems. It contains elegant combinatorial theory, useful and interesting algorithms, and deep results about the intrinsic complexity of combinatorial problems. Its clarity of exposition and excellent selection of exercises will make it accessible and appealing to all those with a taste for mathematics and algorithms. Richard Karp,University Professor, University of California at Berkeley Following the development of basic combinatorial optimization techniques in the 1960s and 1970s, a main open question was to develop a theory of approximation algorithms. In the 1990s, parallel developments in techniques for designing approximation algorithms as well as methods for proving hardness of approximation results have led to a beautiful theory. The need to solve truly large instances of computationally hard problems, such as those arising from the Internet or the human genome project, has also increased interest in this theory. The field is currently very active, with the toolbox of approximation algorithm design techniques getting always richer. It is a pleasure to recommend Vijay Vazirani's well-written and comprehensive book on this important and timely topic. I am sure the reader will find it most useful both as an introduction to approximability as well as a reference to the many aspects of approximation algorithms. László Lovász, Senior Researcher, Microsoft Research</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="653" ind1=" " ind2="0"><subfield code="a">Computer science</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Computer software</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Electronic data processing</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Combinatorics</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Operations research</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><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=" "><subfield code="5">DE-604</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-3-642-08469-0</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-3-662-04565-7</subfield><subfield code="x">Resolving-System</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-30-PQE</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-BAE</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-032083217</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://ebookcentral.proquest.com/lib/munchentech/detail.action?docID=3097734</subfield><subfield code="l">DE-91</subfield><subfield code="p">ZDB-30-PQE</subfield><subfield code="q">TUM_Einzelkauf</subfield><subfield code="x">Agregator</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-662-04565-7</subfield><subfield code="l">DE-91G</subfield><subfield code="p">ZDB-30-PQE</subfield><subfield code="x">Resolving-System</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://ebookcentral.proquest.com/lib/ub-bamberg/detail.action?docID=3097734</subfield><subfield code="l">DE-473</subfield><subfield code="p">ZDB-30-PQE</subfield><subfield code="q">UBG_Einzelkauf</subfield><subfield code="x">Agregator</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-662-04565-7</subfield><subfield code="l">DE-706</subfield><subfield code="p">ZDB-30-PQE</subfield><subfield code="x">Resolving-System</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-662-04565-7</subfield><subfield code="l">DE-739</subfield><subfield code="p">ZDB-2-BAE</subfield><subfield code="q">UPA_Einzelkauf_2024</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV046672238 |
| illustrated | Illustrated |
| index_date | 2024-07-03T14:21:40Z |
| indexdate | 2024-11-12T07:02:15Z |
| institution | BVB |
| isbn | 9783662045657 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-032083217 |
| oclc_num | 1152240922 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM DE-706 DE-473 DE-BY-UBG DE-739 |
| owner_facet | DE-91G DE-BY-TUM DE-706 DE-473 DE-BY-UBG DE-739 |
| physical | 1 Online-Ressource (XIX, 380 Seiten) Illustrationen |
| psigel | ZDB-30-PQE ZDB-2-BAE ZDB-30-PQE TUM_Einzelkauf ZDB-30-PQE UBG_Einzelkauf ZDB-2-BAE UPA_Einzelkauf_2024 |
| publishDate | 2003 |
| publishDateSearch | 2003 |
| publishDateSort | 2003 |
| publisher | Springer |
| record_format | marc |
| spelling | Vazirani, Vijay V. 1957- Verfasser (DE-588)122932196 aut Approximation algorithms Vijay V. Vazirani corrected second printing Berlin ; Heidelberg Springer 2003 1 Online-Ressource (XIX, 380 Seiten) Illustrationen txt rdacontent c rdamedia cr rdacarrier This book covers the dominant theoretical approaches to the approximate solution of hard combinatorial optimization and enumeration problems. It contains elegant combinatorial theory, useful and interesting algorithms, and deep results about the intrinsic complexity of combinatorial problems. Its clarity of exposition and excellent selection of exercises will make it accessible and appealing to all those with a taste for mathematics and algorithms. Richard Karp,University Professor, University of California at Berkeley Following the development of basic combinatorial optimization techniques in the 1960s and 1970s, a main open question was to develop a theory of approximation algorithms. In the 1990s, parallel developments in techniques for designing approximation algorithms as well as methods for proving hardness of approximation results have led to a beautiful theory. The need to solve truly large instances of computationally hard problems, such as those arising from the Internet or the human genome project, has also increased interest in this theory. The field is currently very active, with the toolbox of approximation algorithm design techniques getting always richer. It is a pleasure to recommend Vijay Vazirani's well-written and comprehensive book on this important and timely topic. I am sure the reader will find it most useful both as an introduction to approximability as well as a reference to the many aspects of approximation algorithms. László Lovász, Senior Researcher, Microsoft Research Approximationsalgorithmus (DE-588)4500954-5 gnd rswk-swf Computer science Computer software Electronic data processing Computational complexity Combinatorics Operations research Approximationsalgorithmus (DE-588)4500954-5 s DE-604 Erscheint auch als Druck-Ausgabe 978-3-642-08469-0 https://doi.org/10.1007/978-3-662-04565-7 Resolving-System Volltext |
| spellingShingle | Vazirani, Vijay V. 1957- Approximation algorithms Approximationsalgorithmus (DE-588)4500954-5 gnd |
| subject_GND | (DE-588)4500954-5 |
| title | Approximation algorithms |
| title_auth | Approximation algorithms |
| title_exact_search | Approximation algorithms |
| title_exact_search_txtP | Approximation algorithms |
| title_full | Approximation algorithms Vijay V. Vazirani |
| title_fullStr | Approximation algorithms Vijay V. Vazirani |
| title_full_unstemmed | Approximation algorithms Vijay V. Vazirani |
| title_short | Approximation algorithms |
| title_sort | approximation algorithms |
| topic | Approximationsalgorithmus (DE-588)4500954-5 gnd |
| topic_facet | Approximationsalgorithmus |
| url | https://doi.org/10.1007/978-3-662-04565-7 |
| work_keys_str_mv | AT vaziranivijayv approximationalgorithms |