Paradigms for fast parallel approximability:
Various problems in computer science are 'hard', that is NP-complete, and so not realistically computable; thus in order to solve them they have to be approximated. This book is a survey of the basic techniques for approximating combinatorial problems using parallel algorithms. Its core is...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cambridge
Cambridge University Press
1997
|
| Schriftenreihe: | Cambridge international series on parallel computation
8 |
| Schlagworte: | |
| Online-Zugang: | BSB01 FHN01 URL des Erstveröffentlichers |
| Zusammenfassung: | Various problems in computer science are 'hard', that is NP-complete, and so not realistically computable; thus in order to solve them they have to be approximated. This book is a survey of the basic techniques for approximating combinatorial problems using parallel algorithms. Its core is a collection of techniques that can be used to provide parallel approximations for a wide range of problems (for example, flows, coverings, matchings, travelling salesman problems, graphs), but in order to make the book reasonably self-contained, the authors provide an introductory chapter containing the basic definitions and results. A final chapter deals with problems that cannot be approximated, and the book is ended by an appendix that gives a convenient summary of the problems described in the book. This is an up-to-date reference for research workers in the area of algorithms, but it can also be used for graduate courses in the subject |
| Beschreibung: | Title from publisher's bibliographic system (viewed on 05 Oct 2015) |
| Beschreibung: | 1 online resource (viii, 158 pages) |
| ISBN: | 9780511666407 |
| DOI: | 10.1017/CBO9780511666407 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV043941257 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 161206s1997 |||| o||u| ||||||eng d | ||
| 020 | |a 9780511666407 |c Online |9 978-0-511-66640-7 | ||
| 024 | 7 | |a 10.1017/CBO9780511666407 |2 doi | |
| 035 | |a (ZDB-20-CBO)CR9780511666407 | ||
| 035 | |a (OCoLC)967696859 | ||
| 035 | |a (DE-599)BVBBV043941257 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 |a DE-92 | ||
| 082 | 0 | |a 511/.6/0285435 |2 21 | |
| 084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
| 100 | 1 | |a Díaz, J. |d 1950- |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Paradigms for fast parallel approximability |c Josep Díaz [and others] |
| 264 | 1 | |a Cambridge |b Cambridge University Press |c 1997 | |
| 300 | |a 1 online resource (viii, 158 pages) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Cambridge international series on parallel computation |v 8 | |
| 500 | |a Title from publisher's bibliographic system (viewed on 05 Oct 2015) | ||
| 505 | 8 | 0 | |t Basic concepts |t Extremal graph properties |t Rounding, interval partitioning and separation |t Primal-dual method |t Graph decomposition |t Further parallel approximations |t Non-approximability |t Syntactically defined classes |
| 520 | |a Various problems in computer science are 'hard', that is NP-complete, and so not realistically computable; thus in order to solve them they have to be approximated. This book is a survey of the basic techniques for approximating combinatorial problems using parallel algorithms. Its core is a collection of techniques that can be used to provide parallel approximations for a wide range of problems (for example, flows, coverings, matchings, travelling salesman problems, graphs), but in order to make the book reasonably self-contained, the authors provide an introductory chapter containing the basic definitions and results. A final chapter deals with problems that cannot be approximated, and the book is ended by an appendix that gives a convenient summary of the problems described in the book. This is an up-to-date reference for research workers in the area of algorithms, but it can also be used for graduate courses in the subject | ||
| 650 | 4 | |a Parallel processing (Electronic computers) | |
| 650 | 0 | 7 | |a Parallelrechner |0 (DE-588)4173280-7 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Parallelrechner |0 (DE-588)4173280-7 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druckausgabe |z 978-0-521-11792-0 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druckausgabe |z 978-0-521-43170-5 |
| 856 | 4 | 0 | |u https://doi.org/10.1017/CBO9780511666407 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-20-CBO | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-029350228 | ||
| 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/CBO9780511666407 |l BSB01 |p ZDB-20-CBO |q BSB_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/CBO9780511666407 |l FHN01 |p ZDB-20-CBO |q FHN_PDA_CBO |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804176882714804224 |
|---|---|
| any_adam_object | |
| author | Díaz, J. 1950- |
| author_facet | Díaz, J. 1950- |
| author_role | aut |
| author_sort | Díaz, J. 1950- |
| author_variant | j d jd |
| building | Verbundindex |
| bvnumber | BV043941257 |
| classification_rvk | SK 890 |
| collection | ZDB-20-CBO |
| contents | Basic concepts Extremal graph properties Rounding, interval partitioning and separation Primal-dual method Graph decomposition Further parallel approximations Non-approximability Syntactically defined classes |
| ctrlnum | (ZDB-20-CBO)CR9780511666407 (OCoLC)967696859 (DE-599)BVBBV043941257 |
| dewey-full | 511/.6/0285435 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511/.6/0285435 |
| dewey-search | 511/.6/0285435 |
| dewey-sort | 3511 16 6285435 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| doi_str_mv | 10.1017/CBO9780511666407 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03073nmm a2200481zcb4500</leader><controlfield tag="001">BV043941257</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">161206s1997 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511666407</subfield><subfield code="c">Online</subfield><subfield code="9">978-0-511-66640-7</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1017/CBO9780511666407</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-20-CBO)CR9780511666407</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)967696859</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043941257</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></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511/.6/0285435</subfield><subfield code="2">21</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="100" ind1="1" ind2=" "><subfield code="a">Díaz, J.</subfield><subfield code="d">1950-</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Paradigms for fast parallel approximability</subfield><subfield code="c">Josep Díaz [and others]</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">1997</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (viii, 158 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="490" ind1="0" ind2=" "><subfield code="a">Cambridge international series on parallel computation</subfield><subfield code="v">8</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="505" ind1="8" ind2="0"><subfield code="t">Basic concepts</subfield><subfield code="t">Extremal graph properties</subfield><subfield code="t">Rounding, interval partitioning and separation</subfield><subfield code="t">Primal-dual method</subfield><subfield code="t">Graph decomposition</subfield><subfield code="t">Further parallel approximations</subfield><subfield code="t">Non-approximability</subfield><subfield code="t">Syntactically defined classes</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Various problems in computer science are 'hard', that is NP-complete, and so not realistically computable; thus in order to solve them they have to be approximated. This book is a survey of the basic techniques for approximating combinatorial problems using parallel algorithms. Its core is a collection of techniques that can be used to provide parallel approximations for a wide range of problems (for example, flows, coverings, matchings, travelling salesman problems, graphs), but in order to make the book reasonably self-contained, the authors provide an introductory chapter containing the basic definitions and results. A final chapter deals with problems that cannot be approximated, and the book is ended by an appendix that gives a convenient summary of the problems described in the book. This is an up-to-date reference for research workers in the area of algorithms, but it can also be used for graduate courses in the subject</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel processing (Electronic computers)</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Parallelrechner</subfield><subfield code="0">(DE-588)4173280-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Parallelrechner</subfield><subfield code="0">(DE-588)4173280-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druckausgabe</subfield><subfield code="z">978-0-521-11792-0</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druckausgabe</subfield><subfield code="z">978-0-521-43170-5</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1017/CBO9780511666407</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-029350228</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/CBO9780511666407</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/CBO9780511666407</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></record></collection> |
| id | DE-604.BV043941257 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T07:39:15Z |
| institution | BVB |
| isbn | 9780511666407 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-029350228 |
| oclc_num | 967696859 |
| open_access_boolean | |
| owner | DE-12 DE-92 |
| owner_facet | DE-12 DE-92 |
| physical | 1 online resource (viii, 158 pages) |
| psigel | ZDB-20-CBO ZDB-20-CBO BSB_PDA_CBO ZDB-20-CBO FHN_PDA_CBO |
| publishDate | 1997 |
| publishDateSearch | 1997 |
| publishDateSort | 1997 |
| publisher | Cambridge University Press |
| record_format | marc |
| series2 | Cambridge international series on parallel computation |
| spelling | Díaz, J. 1950- Verfasser aut Paradigms for fast parallel approximability Josep Díaz [and others] Cambridge Cambridge University Press 1997 1 online resource (viii, 158 pages) txt rdacontent c rdamedia cr rdacarrier Cambridge international series on parallel computation 8 Title from publisher's bibliographic system (viewed on 05 Oct 2015) Basic concepts Extremal graph properties Rounding, interval partitioning and separation Primal-dual method Graph decomposition Further parallel approximations Non-approximability Syntactically defined classes Various problems in computer science are 'hard', that is NP-complete, and so not realistically computable; thus in order to solve them they have to be approximated. This book is a survey of the basic techniques for approximating combinatorial problems using parallel algorithms. Its core is a collection of techniques that can be used to provide parallel approximations for a wide range of problems (for example, flows, coverings, matchings, travelling salesman problems, graphs), but in order to make the book reasonably self-contained, the authors provide an introductory chapter containing the basic definitions and results. A final chapter deals with problems that cannot be approximated, and the book is ended by an appendix that gives a convenient summary of the problems described in the book. This is an up-to-date reference for research workers in the area of algorithms, but it can also be used for graduate courses in the subject Parallel processing (Electronic computers) Parallelrechner (DE-588)4173280-7 gnd rswk-swf Parallelrechner (DE-588)4173280-7 s 1\p DE-604 Erscheint auch als Druckausgabe 978-0-521-11792-0 Erscheint auch als Druckausgabe 978-0-521-43170-5 https://doi.org/10.1017/CBO9780511666407 Verlag URL des Erstveröffentlichers Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Díaz, J. 1950- Paradigms for fast parallel approximability Basic concepts Extremal graph properties Rounding, interval partitioning and separation Primal-dual method Graph decomposition Further parallel approximations Non-approximability Syntactically defined classes Parallel processing (Electronic computers) Parallelrechner (DE-588)4173280-7 gnd |
| subject_GND | (DE-588)4173280-7 |
| title | Paradigms for fast parallel approximability |
| title_alt | Basic concepts Extremal graph properties Rounding, interval partitioning and separation Primal-dual method Graph decomposition Further parallel approximations Non-approximability Syntactically defined classes |
| title_auth | Paradigms for fast parallel approximability |
| title_exact_search | Paradigms for fast parallel approximability |
| title_full | Paradigms for fast parallel approximability Josep Díaz [and others] |
| title_fullStr | Paradigms for fast parallel approximability Josep Díaz [and others] |
| title_full_unstemmed | Paradigms for fast parallel approximability Josep Díaz [and others] |
| title_short | Paradigms for fast parallel approximability |
| title_sort | paradigms for fast parallel approximability |
| topic | Parallel processing (Electronic computers) Parallelrechner (DE-588)4173280-7 gnd |
| topic_facet | Parallel processing (Electronic computers) Parallelrechner |
| url | https://doi.org/10.1017/CBO9780511666407 |
| work_keys_str_mv | AT diazj paradigmsforfastparallelapproximability |