Fast approximation algorithms for multicommodity flow problems:
Abstract: "All previously known algorithms for solving the multicommodity flow problem with capacities are based on linear programming. The best of these algorithms [14] uses a fast matrix multiplication algorithm and takes [formula] time to find an approximate solution, where k is the number o...
Saved in:
| Format: | Book |
|---|---|
| Language: | English |
| Published: |
Stanford, Calif.
1991
|
| Series: | Stanford University / Computer Science Department: Report STAN-CS
1375 |
| Subjects: | |
| Summary: | Abstract: "All previously known algorithms for solving the multicommodity flow problem with capacities are based on linear programming. The best of these algorithms [14] uses a fast matrix multiplication algorithm and takes [formula] time to find an approximate solution, where k is the number of commodities, n and m denote the number of nodes and edges in the network, D is the largest demand, and U is the largest edge capacity. Substantially more time is needed to find an exact solution. As a consequence, even multicommodity flow problems with just a few commodities are believed to be much harder than single-commodity maximum-flow or minimum-cost flow problems. |
| Physical Description: | 25 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008979487 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940206s1991 |||| 00||| eng d | ||
| 035 | |a (OCoLC)27432753 | ||
| 035 | |a (DE-599)BVBBV008979487 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T |a DE-91G | ||
| 050 | 0 | |a T57.85 | |
| 245 | 1 | 0 | |a Fast approximation algorithms for multicommodity flow problems |c Tom Leighton ... |
| 264 | 1 | |a Stanford, Calif. |c 1991 | |
| 300 | |a 25 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Stanford University / Computer Science Department: Report STAN-CS |v 1375 | |
| 520 | 3 | |a Abstract: "All previously known algorithms for solving the multicommodity flow problem with capacities are based on linear programming. The best of these algorithms [14] uses a fast matrix multiplication algorithm and takes [formula] time to find an approximate solution, where k is the number of commodities, n and m denote the number of nodes and edges in the network, D is the largest demand, and U is the largest edge capacity. Substantially more time is needed to find an exact solution. As a consequence, even multicommodity flow problems with just a few commodities are believed to be much harder than single-commodity maximum-flow or minimum-cost flow problems. | |
| 650 | 4 | |a Approximation theory | |
| 650 | 4 | |a Network analysis (Planning) | |
| 650 | 4 | |a Programming (Mathematics) | |
| 700 | 1 | |a Leighton, Tom |e Sonstige |0 (DE-588)120559560 |4 oth | |
| 810 | 2 | |a Computer Science Department: Report STAN-CS |t Stanford University |v 1375 |w (DE-604)BV008928280 |9 1375 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005930194 | ||
Record in the Search Index
| _version_ | 1804123318224158720 |
|---|---|
| any_adam_object | |
| author_GND | (DE-588)120559560 |
| building | Verbundindex |
| bvnumber | BV008979487 |
| callnumber-first | T - Technology |
| callnumber-label | T57 |
| callnumber-raw | T57.85 |
| callnumber-search | T57.85 |
| callnumber-sort | T 257.85 |
| callnumber-subject | T - General Technology |
| ctrlnum | (OCoLC)27432753 (DE-599)BVBBV008979487 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01723nam a2200325 cb4500</leader><controlfield tag="001">BV008979487</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1991 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)27432753</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008979487</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield><subfield code="a">DE-91G</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">T57.85</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Fast approximation algorithms for multicommodity flow problems</subfield><subfield code="c">Tom Leighton ...</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Stanford, Calif.</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">25 S.</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">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Stanford University / Computer Science Department: Report STAN-CS</subfield><subfield code="v">1375</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "All previously known algorithms for solving the multicommodity flow problem with capacities are based on linear programming. The best of these algorithms [14] uses a fast matrix multiplication algorithm and takes [formula] time to find an approximate solution, where k is the number of commodities, n and m denote the number of nodes and edges in the network, D is the largest demand, and U is the largest edge capacity. Substantially more time is needed to find an exact solution. As a consequence, even multicommodity flow problems with just a few commodities are believed to be much harder than single-commodity maximum-flow or minimum-cost flow problems.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Approximation theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Network analysis (Planning)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Programming (Mathematics)</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Leighton, Tom</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)120559560</subfield><subfield code="4">oth</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Computer Science Department: Report STAN-CS</subfield><subfield code="t">Stanford University</subfield><subfield code="v">1375</subfield><subfield code="w">(DE-604)BV008928280</subfield><subfield code="9">1375</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005930194</subfield></datafield></record></collection> |
| id | DE-604.BV008979487 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:27:52Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005930194 |
| oclc_num | 27432753 |
| open_access_boolean | |
| owner | DE-29T DE-91G DE-BY-TUM |
| owner_facet | DE-29T DE-91G DE-BY-TUM |
| physical | 25 S. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| record_format | marc |
| series2 | Stanford University / Computer Science Department: Report STAN-CS |
| spelling | Fast approximation algorithms for multicommodity flow problems Tom Leighton ... Stanford, Calif. 1991 25 S. txt rdacontent n rdamedia nc rdacarrier Stanford University / Computer Science Department: Report STAN-CS 1375 Abstract: "All previously known algorithms for solving the multicommodity flow problem with capacities are based on linear programming. The best of these algorithms [14] uses a fast matrix multiplication algorithm and takes [formula] time to find an approximate solution, where k is the number of commodities, n and m denote the number of nodes and edges in the network, D is the largest demand, and U is the largest edge capacity. Substantially more time is needed to find an exact solution. As a consequence, even multicommodity flow problems with just a few commodities are believed to be much harder than single-commodity maximum-flow or minimum-cost flow problems. Approximation theory Network analysis (Planning) Programming (Mathematics) Leighton, Tom Sonstige (DE-588)120559560 oth Computer Science Department: Report STAN-CS Stanford University 1375 (DE-604)BV008928280 1375 |
| spellingShingle | Fast approximation algorithms for multicommodity flow problems Approximation theory Network analysis (Planning) Programming (Mathematics) |
| title | Fast approximation algorithms for multicommodity flow problems |
| title_auth | Fast approximation algorithms for multicommodity flow problems |
| title_exact_search | Fast approximation algorithms for multicommodity flow problems |
| title_full | Fast approximation algorithms for multicommodity flow problems Tom Leighton ... |
| title_fullStr | Fast approximation algorithms for multicommodity flow problems Tom Leighton ... |
| title_full_unstemmed | Fast approximation algorithms for multicommodity flow problems Tom Leighton ... |
| title_short | Fast approximation algorithms for multicommodity flow problems |
| title_sort | fast approximation algorithms for multicommodity flow problems |
| topic | Approximation theory Network analysis (Planning) Programming (Mathematics) |
| topic_facet | Approximation theory Network analysis (Planning) Programming (Mathematics) |
| volume_link | (DE-604)BV008928280 |
| work_keys_str_mv | AT leightontom fastapproximationalgorithmsformulticommodityflowproblems |