Global price updates help:
Abstract: "Periodic global updates of dual variables have been shown to yield a susbtantial speed advantage in implementations of push- relabel algorithms for the maximum flow and minimum cost flow problems. In this paper, we show that in the context of the bipartite matching and assignment pro...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Stanford, Calif.
1994
|
| Schriftenreihe: | Stanford University / Computer Science Department: Report STAN-CS
1509 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "Periodic global updates of dual variables have been shown to yield a susbtantial speed advantage in implementations of push- relabel algorithms for the maximum flow and minimum cost flow problems. In this paper, we show that in the context of the bipartite matching and assignment problems, global updates yield a theoretical improvement as well. For bipartite matching, a push-relabel algorithm that matches the best bound when global updates are used achieves a bound that is worse by a factor of [square root of n] without the updates. A similar result holds for the assignment problem." |
| Beschreibung: | 16 S. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009776783 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940826s1994 d||| |||| 00||| eng d | ||
| 035 | |a (OCoLC)31972782 | ||
| 035 | |a (DE-599)BVBBV009776783 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Goldberg, Andrew V. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Global price updates help |c Andrew V. Goldberg and Robert Kennedy |
| 264 | 1 | |a Stanford, Calif. |c 1994 | |
| 300 | |a 16 S. |b graph. Darst. | ||
| 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 1509 | |
| 520 | 3 | |a Abstract: "Periodic global updates of dual variables have been shown to yield a susbtantial speed advantage in implementations of push- relabel algorithms for the maximum flow and minimum cost flow problems. In this paper, we show that in the context of the bipartite matching and assignment problems, global updates yield a theoretical improvement as well. For bipartite matching, a push-relabel algorithm that matches the best bound when global updates are used achieves a bound that is worse by a factor of [square root of n] without the updates. A similar result holds for the assignment problem." | |
| 650 | 4 | |a Operations research | |
| 700 | 1 | |a Kennedy, Robert |e Verfasser |4 aut | |
| 810 | 2 | |a Computer Science Department: Report STAN-CS |t Stanford University |v 1509 |w (DE-604)BV008928280 |9 1509 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006468902 | ||
Datensatz im Suchindex
| _version_ | 1804124125678010368 |
|---|---|
| any_adam_object | |
| author | Goldberg, Andrew V. Kennedy, Robert |
| author_facet | Goldberg, Andrew V. Kennedy, Robert |
| author_role | aut aut |
| author_sort | Goldberg, Andrew V. |
| author_variant | a v g av avg r k rk |
| building | Verbundindex |
| bvnumber | BV009776783 |
| ctrlnum | (OCoLC)31972782 (DE-599)BVBBV009776783 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01572nam a2200301 cb4500</leader><controlfield tag="001">BV009776783</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940826s1994 d||| |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)31972782</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009776783</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></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Goldberg, Andrew V.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Global price updates help</subfield><subfield code="c">Andrew V. Goldberg and Robert Kennedy</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Stanford, Calif.</subfield><subfield code="c">1994</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">16 S.</subfield><subfield code="b">graph. Darst.</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">1509</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Periodic global updates of dual variables have been shown to yield a susbtantial speed advantage in implementations of push- relabel algorithms for the maximum flow and minimum cost flow problems. In this paper, we show that in the context of the bipartite matching and assignment problems, global updates yield a theoretical improvement as well. For bipartite matching, a push-relabel algorithm that matches the best bound when global updates are used achieves a bound that is worse by a factor of [square root of n] without the updates. A similar result holds for the assignment problem."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Operations research</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Kennedy, Robert</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</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">1509</subfield><subfield code="w">(DE-604)BV008928280</subfield><subfield code="9">1509</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006468902</subfield></datafield></record></collection> |
| id | DE-604.BV009776783 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T17:40:42Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006468902 |
| oclc_num | 31972782 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 16 S. graph. Darst. |
| publishDate | 1994 |
| publishDateSearch | 1994 |
| publishDateSort | 1994 |
| record_format | marc |
| series2 | Stanford University / Computer Science Department: Report STAN-CS |
| spelling | Goldberg, Andrew V. Verfasser aut Global price updates help Andrew V. Goldberg and Robert Kennedy Stanford, Calif. 1994 16 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Stanford University / Computer Science Department: Report STAN-CS 1509 Abstract: "Periodic global updates of dual variables have been shown to yield a susbtantial speed advantage in implementations of push- relabel algorithms for the maximum flow and minimum cost flow problems. In this paper, we show that in the context of the bipartite matching and assignment problems, global updates yield a theoretical improvement as well. For bipartite matching, a push-relabel algorithm that matches the best bound when global updates are used achieves a bound that is worse by a factor of [square root of n] without the updates. A similar result holds for the assignment problem." Operations research Kennedy, Robert Verfasser aut Computer Science Department: Report STAN-CS Stanford University 1509 (DE-604)BV008928280 1509 |
| spellingShingle | Goldberg, Andrew V. Kennedy, Robert Global price updates help Operations research |
| title | Global price updates help |
| title_auth | Global price updates help |
| title_exact_search | Global price updates help |
| title_full | Global price updates help Andrew V. Goldberg and Robert Kennedy |
| title_fullStr | Global price updates help Andrew V. Goldberg and Robert Kennedy |
| title_full_unstemmed | Global price updates help Andrew V. Goldberg and Robert Kennedy |
| title_short | Global price updates help |
| title_sort | global price updates help |
| topic | Operations research |
| topic_facet | Operations research |
| volume_link | (DE-604)BV008928280 |
| work_keys_str_mv | AT goldbergandrewv globalpriceupdateshelp AT kennedyrobert globalpriceupdateshelp |