Probabilistic combinatorial optimization on graphs:
Saved in:
| Main Author: | |
|---|---|
| Format: | Electronic eBook |
| Language: | English |
| Published: |
London
ISTE
2006
|
| Subjects: | |
| Online Access: | FRO01 UBG01 Volltext |
| Item Description: | Includes bibliographical references (pages 255-259) and index This title provides a comprehensive survey over the subject of probabilistic combinatorial optimization, discussing probabilistic versions of some of the most paradigmatic combinatorial problems on graphs, such as the maximum independent set, the minimum vertex covering, the longest path and the minimum coloring. Detailed discussion is given to a priori optimization, which is adopted as the main working hypothesis: starting from an a priori solution of a super instance of a problem, where any datum is present with a certain probability, this hypothesis consists of creating modifications in or |
| Physical Description: | 1 Online-Ressource (267 pages) |
| ISBN: | 9780470612507 0470612509 9781847045836 1847045839 1280510617 9781280510618 9781905209330 |
Staff View
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV043390511 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 160222s2006 |||| o||u| ||||||eng d | ||
| 020 | |a 9780470612507 |9 978-0-470-61250-7 | ||
| 020 | |a 0470612509 |9 0-470-61250-9 | ||
| 020 | |a 9781847045836 |c electronic bk. |9 978-1-84704-583-6 | ||
| 020 | |a 1847045839 |c electronic bk. |9 1-84704-583-9 | ||
| 020 | |a 1280510617 |9 1-280-51061-7 | ||
| 020 | |a 9781280510618 |9 978-1-280-51061-8 | ||
| 020 | |a 9781905209330 |9 978-1-905209-33-0 | ||
| 024 | 7 | |a 10.1002/9780470612507 |2 doi | |
| 035 | |a (ZDB-35-WIC)ocn501313838 | ||
| 035 | |a (OCoLC)501313838 | ||
| 035 | |a (DE-599)BVBBV043390511 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-861 | ||
| 082 | 0 | |a 2 22 |2 22 | |
| 082 | 0 | |a 519.2 |2 22 | |
| 100 | 1 | |a Murat, Cecile |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Probabilistic combinatorial optimization on graphs |c Cécile Murat and Vangelis Th. Paschos |
| 264 | 1 | |a London |b ISTE |c 2006 | |
| 300 | |a 1 Online-Ressource (267 pages) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 500 | |a Includes bibliographical references (pages 255-259) and index | ||
| 500 | |a This title provides a comprehensive survey over the subject of probabilistic combinatorial optimization, discussing probabilistic versions of some of the most paradigmatic combinatorial problems on graphs, such as the maximum independent set, the minimum vertex covering, the longest path and the minimum coloring. Detailed discussion is given to a priori optimization, which is adopted as the main working hypothesis: starting from an a priori solution of a super instance of a problem, where any datum is present with a certain probability, this hypothesis consists of creating modifications in or | ||
| 650 | 4 | |a Probabilités combinatoires | |
| 650 | 4 | |a Optimisation combinatoire | |
| 650 | 4 | |a Graphes aléatoires | |
| 650 | 7 | |a MATHEMATICS / Probability & Statistics / General |2 bisacsh | |
| 650 | 7 | |a Combinatorial optimization |2 fast | |
| 650 | 7 | |a Combinatorial probabilities |2 fast | |
| 650 | 7 | |a Random graphs |2 fast | |
| 650 | 4 | |a Combinatorial probabilities | |
| 650 | 4 | |a Combinatorial optimization | |
| 650 | 4 | |a Random graphs | |
| 700 | 1 | |a Paschos, Vangelis Th |e Sonstige |4 oth | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe, Hardcover |z 1-905209-33-9 |
| 856 | 4 | 0 | |u https://onlinelibrary.wiley.com/doi/book/10.1002/9780470612507 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-35-WIC | ||
| 940 | 1 | |q UBG_PDA_WIC | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-028809095 | ||
| 966 | e | |u https://onlinelibrary.wiley.com/doi/book/10.1002/9780470612507 |l FRO01 |p ZDB-35-WIC |q FRO_PDA_WIC |x Verlag |3 Volltext | |
| 966 | e | |u https://onlinelibrary.wiley.com/doi/book/10.1002/9780470612507 |l UBG01 |p ZDB-35-WIC |q UBG_PDA_WIC |x Verlag |3 Volltext | |
Record in the Search Index
| _version_ | 1804175964775645184 |
|---|---|
| any_adam_object | |
| author | Murat, Cecile |
| author_facet | Murat, Cecile |
| author_role | aut |
| author_sort | Murat, Cecile |
| author_variant | c m cm |
| building | Verbundindex |
| bvnumber | BV043390511 |
| collection | ZDB-35-WIC |
| ctrlnum | (ZDB-35-WIC)ocn501313838 (OCoLC)501313838 (DE-599)BVBBV043390511 |
| dewey-full | 222 519.2 |
| dewey-hundreds | 000 - Computer science, information, general works 500 - Natural sciences and mathematics |
| dewey-ones | 002 - The book 519 - Probabilities and applied mathematics |
| dewey-raw | 2 22 519.2 |
| dewey-search | 2 22 519.2 |
| dewey-sort | 12 222 |
| dewey-tens | 000 - Computer science, information, general works 510 - Mathematics |
| discipline | Mathematik Theologie / Religionswissenschaften |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02906nmm a2200601zc 4500</leader><controlfield tag="001">BV043390511</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">160222s2006 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780470612507</subfield><subfield code="9">978-0-470-61250-7</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0470612509</subfield><subfield code="9">0-470-61250-9</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781847045836</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">978-1-84704-583-6</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1847045839</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">1-84704-583-9</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1280510617</subfield><subfield code="9">1-280-51061-7</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781280510618</subfield><subfield code="9">978-1-280-51061-8</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781905209330</subfield><subfield code="9">978-1-905209-33-0</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1002/9780470612507</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-35-WIC)ocn501313838</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)501313838</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043390511</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-861</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">2 22</subfield><subfield code="2">22</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">519.2</subfield><subfield code="2">22</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Murat, Cecile</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Probabilistic combinatorial optimization on graphs</subfield><subfield code="c">Cécile Murat and Vangelis Th. Paschos</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">London</subfield><subfield code="b">ISTE</subfield><subfield code="c">2006</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (267 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">Includes bibliographical references (pages 255-259) and index</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">This title provides a comprehensive survey over the subject of probabilistic combinatorial optimization, discussing probabilistic versions of some of the most paradigmatic combinatorial problems on graphs, such as the maximum independent set, the minimum vertex covering, the longest path and the minimum coloring. Detailed discussion is given to a priori optimization, which is adopted as the main working hypothesis: starting from an a priori solution of a super instance of a problem, where any datum is present with a certain probability, this hypothesis consists of creating modifications in or</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Probabilités combinatoires</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Optimisation combinatoire</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graphes aléatoires</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS / Probability & Statistics / General</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Combinatorial optimization</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Combinatorial probabilities</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Random graphs</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorial probabilities</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorial optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Random graphs</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Paschos, Vangelis Th</subfield><subfield code="e">Sonstige</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, Hardcover</subfield><subfield code="z">1-905209-33-9</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://onlinelibrary.wiley.com/doi/book/10.1002/9780470612507</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-35-WIC</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">UBG_PDA_WIC</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-028809095</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://onlinelibrary.wiley.com/doi/book/10.1002/9780470612507</subfield><subfield code="l">FRO01</subfield><subfield code="p">ZDB-35-WIC</subfield><subfield code="q">FRO_PDA_WIC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://onlinelibrary.wiley.com/doi/book/10.1002/9780470612507</subfield><subfield code="l">UBG01</subfield><subfield code="p">ZDB-35-WIC</subfield><subfield code="q">UBG_PDA_WIC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV043390511 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T07:24:39Z |
| institution | BVB |
| isbn | 9780470612507 0470612509 9781847045836 1847045839 1280510617 9781280510618 9781905209330 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-028809095 |
| oclc_num | 501313838 |
| open_access_boolean | |
| owner | DE-861 |
| owner_facet | DE-861 |
| physical | 1 Online-Ressource (267 pages) |
| psigel | ZDB-35-WIC UBG_PDA_WIC ZDB-35-WIC FRO_PDA_WIC ZDB-35-WIC UBG_PDA_WIC |
| publishDate | 2006 |
| publishDateSearch | 2006 |
| publishDateSort | 2006 |
| publisher | ISTE |
| record_format | marc |
| spelling | Murat, Cecile Verfasser aut Probabilistic combinatorial optimization on graphs Cécile Murat and Vangelis Th. Paschos London ISTE 2006 1 Online-Ressource (267 pages) txt rdacontent c rdamedia cr rdacarrier Includes bibliographical references (pages 255-259) and index This title provides a comprehensive survey over the subject of probabilistic combinatorial optimization, discussing probabilistic versions of some of the most paradigmatic combinatorial problems on graphs, such as the maximum independent set, the minimum vertex covering, the longest path and the minimum coloring. Detailed discussion is given to a priori optimization, which is adopted as the main working hypothesis: starting from an a priori solution of a super instance of a problem, where any datum is present with a certain probability, this hypothesis consists of creating modifications in or Probabilités combinatoires Optimisation combinatoire Graphes aléatoires MATHEMATICS / Probability & Statistics / General bisacsh Combinatorial optimization fast Combinatorial probabilities fast Random graphs fast Combinatorial probabilities Combinatorial optimization Random graphs Paschos, Vangelis Th Sonstige oth Erscheint auch als Druck-Ausgabe, Hardcover 1-905209-33-9 https://onlinelibrary.wiley.com/doi/book/10.1002/9780470612507 Verlag URL des Erstveröffentlichers Volltext |
| spellingShingle | Murat, Cecile Probabilistic combinatorial optimization on graphs Probabilités combinatoires Optimisation combinatoire Graphes aléatoires MATHEMATICS / Probability & Statistics / General bisacsh Combinatorial optimization fast Combinatorial probabilities fast Random graphs fast Combinatorial probabilities Combinatorial optimization Random graphs |
| title | Probabilistic combinatorial optimization on graphs |
| title_auth | Probabilistic combinatorial optimization on graphs |
| title_exact_search | Probabilistic combinatorial optimization on graphs |
| title_full | Probabilistic combinatorial optimization on graphs Cécile Murat and Vangelis Th. Paschos |
| title_fullStr | Probabilistic combinatorial optimization on graphs Cécile Murat and Vangelis Th. Paschos |
| title_full_unstemmed | Probabilistic combinatorial optimization on graphs Cécile Murat and Vangelis Th. Paschos |
| title_short | Probabilistic combinatorial optimization on graphs |
| title_sort | probabilistic combinatorial optimization on graphs |
| topic | Probabilités combinatoires Optimisation combinatoire Graphes aléatoires MATHEMATICS / Probability & Statistics / General bisacsh Combinatorial optimization fast Combinatorial probabilities fast Random graphs fast Combinatorial probabilities Combinatorial optimization Random graphs |
| topic_facet | Probabilités combinatoires Optimisation combinatoire Graphes aléatoires MATHEMATICS / Probability & Statistics / General Combinatorial optimization Combinatorial probabilities Random graphs |
| url | https://onlinelibrary.wiley.com/doi/book/10.1002/9780470612507 |
| work_keys_str_mv | AT muratcecile probabilisticcombinatorialoptimizationongraphs AT paschosvangelisth probabilisticcombinatorialoptimizationongraphs |