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:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cambridge
Cambridge University Press
2019
|
| Schlagworte: | |
| Online-Zugang: | DE-12 DE-92 DE-473 Volltext |
| 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 |
| Beschreibung: | Title from publisher's bibliographic system (viewed on 26 Aug 2019) |
| Beschreibung: | 1 Online-Ressource (xii, 314 Seiten) |
| ISBN: | 9781316888568 |
| DOI: | 10.1017/9781316888568 |
Internformat
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV046200032 | ||
| 003 | DE-604 | ||
| 005 | 20241022 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 191016s2019 |||| o||u| ||||||eng d | ||
| 020 | |a 9781316888568 |c Online |9 978-1-316-88856-8 | ||
| 024 | 7 | |a 10.1017/9781316888568 |2 doi | |
| 035 | |a (ZDB-20-CBO)CR9781316888568 | ||
| 035 | |a (OCoLC)1124789805 | ||
| 035 | |a (DE-599)BVBBV046200032 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 |a DE-92 |a DE-473 | ||
| 082 | 0 | |a 003 | |
| 084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
| 084 | |a ST 132 |0 (DE-625)143589: |2 rvk | ||
| 100 | 1 | |a Williamson, David P. |d 1967- |0 (DE-588)1013297776 |4 aut | |
| 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 |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 500 | |a Title from publisher's bibliographic system (viewed on 26 Aug 2019) | ||
| 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 | ||
| 650 | 4 | |a Network analysis (Planning) / Computer programs | |
| 650 | 4 | |a System theory | |
| 650 | 4 | |a Computer algorithms | |
| 650 | 0 | 7 | |a Netzwerkfluss |0 (DE-588)4126130-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Optimierung |0 (DE-588)4043664-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Netzwerkfluss |0 (DE-588)4126130-6 |D s |
| 689 | 0 | 1 | |a Optimierung |0 (DE-588)4043664-0 |D s |
| 689 | 0 | 2 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe, Hardcover |z 978-1-107-18589-0 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe, Paperback |z 978-1-316-63683-1 |
| 856 | 4 | 0 | |u https://doi.org/10.1017/9781316888568 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-20-CBO | ||
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-031579191 | |
| 966 | e | |u https://doi.org/10.1017/9781316888568 |l DE-12 |p ZDB-20-CBO |q BSB_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/9781316888568 |l DE-92 |p ZDB-20-CBO |q FHN_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/9781316888568 |l DE-473 |p ZDB-20-CBO |q UBG_Einzelkauf |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1813615414388719616 |
|---|---|
| adam_text | |
| any_adam_object | |
| author | Williamson, David P. 1967- |
| author_GND | (DE-588)1013297776 |
| author_facet | Williamson, David P. 1967- |
| author_role | aut |
| author_sort | Williamson, David P. 1967- |
| author_variant | d p w dp dpw |
| building | Verbundindex |
| bvnumber | BV046200032 |
| classification_rvk | SK 890 ST 132 |
| collection | ZDB-20-CBO |
| ctrlnum | (ZDB-20-CBO)CR9781316888568 (OCoLC)1124789805 (DE-599)BVBBV046200032 |
| dewey-full | 003 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 003 - Systems |
| dewey-raw | 003 |
| dewey-search | 003 |
| dewey-sort | 13 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik Mathematik |
| doi_str_mv | 10.1017/9781316888568 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nmm a2200000zc 4500</leader><controlfield tag="001">BV046200032</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20241022</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">191016s2019 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781316888568</subfield><subfield code="c">Online</subfield><subfield code="9">978-1-316-88856-8</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1017/9781316888568</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-20-CBO)CR9781316888568</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1124789805</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV046200032</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><subfield code="a">DE-473</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">003</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">ST 132</subfield><subfield code="0">(DE-625)143589:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Williamson, David P.</subfield><subfield code="d">1967-</subfield><subfield code="0">(DE-588)1013297776</subfield><subfield code="4">aut</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><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">Title from publisher's bibliographic system (viewed on 26 Aug 2019)</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="650" ind1=" " ind2="4"><subfield code="a">Network analysis (Planning) / Computer programs</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">System theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer algorithms</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Netzwerkfluss</subfield><subfield code="0">(DE-588)4126130-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Optimierung</subfield><subfield code="0">(DE-588)4043664-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Netzwerkfluss</subfield><subfield code="0">(DE-588)4126130-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Optimierung</subfield><subfield code="0">(DE-588)4043664-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-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, Hardcover</subfield><subfield code="z">978-1-107-18589-0</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe, Paperback</subfield><subfield code="z">978-1-316-63683-1</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1017/9781316888568</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="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-031579191</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/9781316888568</subfield><subfield code="l">DE-12</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/9781316888568</subfield><subfield code="l">DE-92</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><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/9781316888568</subfield><subfield code="l">DE-473</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">UBG_Einzelkauf</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV046200032 |
| illustrated | Not Illustrated |
| indexdate | 2024-10-22T12:00:40Z |
| institution | BVB |
| isbn | 9781316888568 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-031579191 |
| oclc_num | 1124789805 |
| open_access_boolean | |
| owner | DE-12 DE-92 DE-473 DE-BY-UBG |
| owner_facet | DE-12 DE-92 DE-473 DE-BY-UBG |
| physical | 1 Online-Ressource (xii, 314 Seiten) |
| psigel | ZDB-20-CBO ZDB-20-CBO BSB_PDA_CBO ZDB-20-CBO FHN_PDA_CBO ZDB-20-CBO UBG_Einzelkauf |
| publishDate | 2019 |
| publishDateSearch | 2019 |
| publishDateSort | 2019 |
| publisher | Cambridge University Press |
| record_format | marc |
| spelling | Williamson, David P. 1967- (DE-588)1013297776 aut Network flow algorithms David P. Williamson Cambridge Cambridge University Press 2019 1 Online-Ressource (xii, 314 Seiten) txt rdacontent c rdamedia cr rdacarrier Title from publisher's bibliographic system (viewed on 26 Aug 2019) 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 Network analysis (Planning) / Computer programs System theory Computer algorithms Netzwerkfluss (DE-588)4126130-6 gnd rswk-swf Optimierung (DE-588)4043664-0 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Netzwerkfluss (DE-588)4126130-6 s Optimierung (DE-588)4043664-0 s Algorithmus (DE-588)4001183-5 s DE-604 Erscheint auch als Druck-Ausgabe, Hardcover 978-1-107-18589-0 Erscheint auch als Druck-Ausgabe, Paperback 978-1-316-63683-1 https://doi.org/10.1017/9781316888568 Verlag URL des Erstveröffentlichers Volltext |
| spellingShingle | Williamson, David P. 1967- Network flow algorithms Network analysis (Planning) / Computer programs System theory Computer algorithms Netzwerkfluss (DE-588)4126130-6 gnd Optimierung (DE-588)4043664-0 gnd Algorithmus (DE-588)4001183-5 gnd |
| subject_GND | (DE-588)4126130-6 (DE-588)4043664-0 (DE-588)4001183-5 |
| 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 |
| topic | Network analysis (Planning) / Computer programs System theory Computer algorithms Netzwerkfluss (DE-588)4126130-6 gnd Optimierung (DE-588)4043664-0 gnd Algorithmus (DE-588)4001183-5 gnd |
| topic_facet | Network analysis (Planning) / Computer programs System theory Computer algorithms Netzwerkfluss Optimierung Algorithmus |
| url | https://doi.org/10.1017/9781316888568 |
| work_keys_str_mv | AT williamsondavidp networkflowalgorithms |