Network flow algorithms:
Network flow theory has been used across a number of disciplines, including theoretical computer science, operations research, and discrete math, to model not only problems in the transportation of goods and information, but also a wide range of applications from image segmentation problems in compu...
Gespeichert in:
| Beteilige Person: | |
|---|---|
| Format: | E-Book |
| Sprache: | Englisch |
| Veröffentlicht: |
Cambridge
Cambridge University Press
2019
|
| Links: | https://doi.org/10.1017/9781316888568 |
| Zusammenfassung: | Network flow theory has been used across a number of disciplines, including theoretical computer science, operations research, and discrete math, to model not only problems in the transportation of goods and information, but also a wide range of applications from image segmentation problems in computer vision to deciding when a baseball team has been eliminated from contention. This graduate text and reference presents a succinct, unified view of a wide variety of efficient combinatorial algorithms for network flow problems, including many results not found in other books. It covers maximum flows, minimum-cost flows, generalized flows, multicommodity flows, and global minimum cuts and also presents recent work on computing electrical flows along with recent applications of these flows to classical problems in network flow theory. |
| Umfang: | 1 Online-Ressource (xii, 314 Seiten) |
| ISBN: | 9781316888568 |
Internformat
MARC
| LEADER | 00000nam a2200000 i 4500 | ||
|---|---|---|---|
| 001 | ZDB-20-CTM-CR9781316888568 | ||
| 003 | UkCbUP | ||
| 005 | 20190830142610.0 | ||
| 006 | m|||||o||d|||||||| | ||
| 007 | cr|||||||||||| | ||
| 008 | 160624s2019||||enk o ||1 0|eng|d | ||
| 020 | |a 9781316888568 | ||
| 100 | 1 | |a Williamson, David P. | |
| 245 | 1 | 0 | |a Network flow algorithms |c David P. Williamson |
| 264 | 1 | |a Cambridge |b Cambridge University Press |c 2019 | |
| 300 | |a 1 Online-Ressource (xii, 314 Seiten) | ||
| 336 | |b txt | ||
| 337 | |b c | ||
| 338 | |b cr | ||
| 520 | |a Network flow theory has been used across a number of disciplines, including theoretical computer science, operations research, and discrete math, to model not only problems in the transportation of goods and information, but also a wide range of applications from image segmentation problems in computer vision to deciding when a baseball team has been eliminated from contention. This graduate text and reference presents a succinct, unified view of a wide variety of efficient combinatorial algorithms for network flow problems, including many results not found in other books. It covers maximum flows, minimum-cost flows, generalized flows, multicommodity flows, and global minimum cuts and also presents recent work on computing electrical flows along with recent applications of these flows to classical problems in network flow theory. | ||
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781107185890 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781316636831 |
| 966 | 4 | 0 | |l DE-91 |p ZDB-20-CTM |q TUM_PDA_CTM |u https://doi.org/10.1017/9781316888568 |3 Volltext |
| 912 | |a ZDB-20-CTM | ||
| 912 | |a ZDB-20-CTM | ||
| 049 | |a DE-91 | ||
Datensatz im Suchindex
| DE-BY-TUM_katkey | ZDB-20-CTM-CR9781316888568 |
|---|---|
| _version_ | 1825574047829721089 |
| adam_text | |
| any_adam_object | |
| author | Williamson, David P. |
| author_facet | Williamson, David P. |
| author_role | |
| author_sort | Williamson, David P. |
| author_variant | d p w dp dpw |
| building | Verbundindex |
| bvnumber | localTUM |
| collection | ZDB-20-CTM |
| format | eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01580nam a2200253 i 4500</leader><controlfield tag="001">ZDB-20-CTM-CR9781316888568</controlfield><controlfield tag="003">UkCbUP</controlfield><controlfield tag="005">20190830142610.0</controlfield><controlfield tag="006">m|||||o||d||||||||</controlfield><controlfield tag="007">cr||||||||||||</controlfield><controlfield tag="008">160624s2019||||enk o ||1 0|eng|d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781316888568</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Williamson, David P.</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Network flow algorithms</subfield><subfield code="c">David P. Williamson</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">2019</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (xii, 314 Seiten)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Network flow theory has been used across a number of disciplines, including theoretical computer science, operations research, and discrete math, to model not only problems in the transportation of goods and information, but also a wide range of applications from image segmentation problems in computer vision to deciding when a baseball team has been eliminated from contention. This graduate text and reference presents a succinct, unified view of a wide variety of efficient combinatorial algorithms for network flow problems, including many results not found in other books. It covers maximum flows, minimum-cost flows, generalized flows, multicommodity flows, and global minimum cuts and also presents recent work on computing electrical flows along with recent applications of these flows to classical problems in network flow theory.</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">9781107185890</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">9781316636831</subfield></datafield><datafield tag="966" ind1="4" ind2="0"><subfield code="l">DE-91</subfield><subfield code="p">ZDB-20-CTM</subfield><subfield code="q">TUM_PDA_CTM</subfield><subfield code="u">https://doi.org/10.1017/9781316888568</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CTM</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CTM</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield></datafield></record></collection> |
| id | ZDB-20-CTM-CR9781316888568 |
| illustrated | Not Illustrated |
| indexdate | 2025-03-03T11:58:02Z |
| institution | BVB |
| isbn | 9781316888568 |
| language | English |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM |
| owner_facet | DE-91 DE-BY-TUM |
| physical | 1 Online-Ressource (xii, 314 Seiten) |
| psigel | ZDB-20-CTM TUM_PDA_CTM ZDB-20-CTM |
| publishDate | 2019 |
| publishDateSearch | 2019 |
| publishDateSort | 2019 |
| publisher | Cambridge University Press |
| record_format | marc |
| spelling | Williamson, David P. Network flow algorithms David P. Williamson Cambridge Cambridge University Press 2019 1 Online-Ressource (xii, 314 Seiten) txt c cr Network flow theory has been used across a number of disciplines, including theoretical computer science, operations research, and discrete math, to model not only problems in the transportation of goods and information, but also a wide range of applications from image segmentation problems in computer vision to deciding when a baseball team has been eliminated from contention. This graduate text and reference presents a succinct, unified view of a wide variety of efficient combinatorial algorithms for network flow problems, including many results not found in other books. It covers maximum flows, minimum-cost flows, generalized flows, multicommodity flows, and global minimum cuts and also presents recent work on computing electrical flows along with recent applications of these flows to classical problems in network flow theory. Erscheint auch als Druck-Ausgabe 9781107185890 Erscheint auch als Druck-Ausgabe 9781316636831 |
| spellingShingle | Williamson, David P. Network flow algorithms |
| title | Network flow algorithms |
| title_auth | Network flow algorithms |
| title_exact_search | Network flow algorithms |
| title_full | Network flow algorithms David P. Williamson |
| title_fullStr | Network flow algorithms David P. Williamson |
| title_full_unstemmed | Network flow algorithms David P. Williamson |
| title_short | Network flow algorithms |
| title_sort | network flow algorithms |
| work_keys_str_mv | AT williamsondavidp networkflowalgorithms |