A fast parametric maximum flow algorithm and applications
The classical maximum flow problem sometimes occurs in settings in which the arc capacities are not fixed but are functions of a single parameter, and the goal is to find the value of the parameter such that the corresponding maximum flow or minimum cut satisfies some side condition. Finding the des...
Gespeichert in:
| Veröffentlicht in: | SIAM journal on computing 1989-02, Vol.18 (1), p.30-55 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 55 |
|---|---|
| container_issue | 1 |
| container_start_page | 30 |
| container_title | SIAM journal on computing |
| container_volume | 18 |
| creator | GALLO, G GRIGORIADIS, M. D TARJAN, R. E |
| description | The classical maximum flow problem sometimes occurs in settings in which the arc capacities are not fixed but are functions of a single parameter, and the goal is to find the value of the parameter such that the corresponding maximum flow or minimum cut satisfies some side condition. Finding the desired parameter value requires solving a sequence of related maximum flow problems. In this paper it is shown that the recent maximum flow algorithm of Goldberg and Tarjan can be extended to solve an important class of such parametric maximum flow problems, at the cost of only a constant factor in its worst-case time bound. Faster algorithms for a variety of combinatorial optimization problems follow from the result. |
| doi_str_mv | 10.1137/0218003 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_919784319</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2578271171</sourcerecordid><originalsourceid>FETCH-LOGICAL-c345t-fdf4181f4927b779123ecb6468b9b94bdbab00ada5fdddf707cfcd50502d178e3</originalsourceid><addsrcrecordid>eNo9kEtLxDAURoMoOI7iXwgiuKre2yRNsxwGXzDgRtflNmk0Q18mLeq_d2QGV9_mcD44jF0i3CIKfQc5lgDiiC0QjMo0Ih6zBYDRmRJGn7KzlLYAKCWKBTMr7ilNfKRIXTPFYHlH36GbO-7b4YtT-z7EMH10nHrHaRzbYGkKQ5_O2YmnNjUXh12yt4f71_VTtnl5fF6vNpkVUk2Zd15iiV6aXNdaG8xFY-tCFmVtaiNrV1MNQI6Ud855Ddp66xQoyB3qshFLdrX3jnH4nJs0Vdthjv3usjJodCkFmh10s4dsHFKKja_GGDqKPxVC9ZelOmTZkdcHHSVLrY_U25D-cS2gKAolfgEaG2B4</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>919784319</pqid></control><display><type>article</type><title>A fast parametric maximum flow algorithm and applications</title><source>SIAM Journals Online</source><creator>GALLO, G ; GRIGORIADIS, M. D ; TARJAN, R. E</creator><creatorcontrib>GALLO, G ; GRIGORIADIS, M. D ; TARJAN, R. E</creatorcontrib><description>The classical maximum flow problem sometimes occurs in settings in which the arc capacities are not fixed but are functions of a single parameter, and the goal is to find the value of the parameter such that the corresponding maximum flow or minimum cut satisfies some side condition. Finding the desired parameter value requires solving a sequence of related maximum flow problems. In this paper it is shown that the recent maximum flow algorithm of Goldberg and Tarjan can be extended to solve an important class of such parametric maximum flow problems, at the cost of only a constant factor in its worst-case time bound. Faster algorithms for a variety of combinatorial optimization problems follow from the result.</description><identifier>ISSN: 0097-5397</identifier><identifier>EISSN: 1095-7111</identifier><identifier>DOI: 10.1137/0218003</identifier><language>eng</language><publisher>Philadelphia, PA: Society for Industrial and Applied Mathematics</publisher><subject>Algorithms ; Applied sciences ; Computer science ; Exact sciences and technology ; Flows in networks. Combinatorial problems ; Labeling ; Linear programming ; Mathematical functions ; Operational research and scientific management ; Operational research. Management science ; Optimization</subject><ispartof>SIAM journal on computing, 1989-02, Vol.18 (1), p.30-55</ispartof><rights>1989 INIST-CNRS</rights><rights>[Copyright] © 1989 Society for Industrial and Applied Mathematics</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c345t-fdf4181f4927b779123ecb6468b9b94bdbab00ada5fdddf707cfcd50502d178e3</citedby><cites>FETCH-LOGICAL-c345t-fdf4181f4927b779123ecb6468b9b94bdbab00ada5fdddf707cfcd50502d178e3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,3171,27901,27902</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=7306665$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>GALLO, G</creatorcontrib><creatorcontrib>GRIGORIADIS, M. D</creatorcontrib><creatorcontrib>TARJAN, R. E</creatorcontrib><title>A fast parametric maximum flow algorithm and applications</title><title>SIAM journal on computing</title><description>The classical maximum flow problem sometimes occurs in settings in which the arc capacities are not fixed but are functions of a single parameter, and the goal is to find the value of the parameter such that the corresponding maximum flow or minimum cut satisfies some side condition. Finding the desired parameter value requires solving a sequence of related maximum flow problems. In this paper it is shown that the recent maximum flow algorithm of Goldberg and Tarjan can be extended to solve an important class of such parametric maximum flow problems, at the cost of only a constant factor in its worst-case time bound. Faster algorithms for a variety of combinatorial optimization problems follow from the result.</description><subject>Algorithms</subject><subject>Applied sciences</subject><subject>Computer science</subject><subject>Exact sciences and technology</subject><subject>Flows in networks. Combinatorial problems</subject><subject>Labeling</subject><subject>Linear programming</subject><subject>Mathematical functions</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><subject>Optimization</subject><issn>0097-5397</issn><issn>1095-7111</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1989</creationdate><recordtype>article</recordtype><sourceid>8G5</sourceid><sourceid>BENPR</sourceid><sourceid>GUQSH</sourceid><sourceid>M2O</sourceid><recordid>eNo9kEtLxDAURoMoOI7iXwgiuKre2yRNsxwGXzDgRtflNmk0Q18mLeq_d2QGV9_mcD44jF0i3CIKfQc5lgDiiC0QjMo0Ih6zBYDRmRJGn7KzlLYAKCWKBTMr7ilNfKRIXTPFYHlH36GbO-7b4YtT-z7EMH10nHrHaRzbYGkKQ5_O2YmnNjUXh12yt4f71_VTtnl5fF6vNpkVUk2Zd15iiV6aXNdaG8xFY-tCFmVtaiNrV1MNQI6Ud855Ddp66xQoyB3qshFLdrX3jnH4nJs0Vdthjv3usjJodCkFmh10s4dsHFKKja_GGDqKPxVC9ZelOmTZkdcHHSVLrY_U25D-cS2gKAolfgEaG2B4</recordid><startdate>19890201</startdate><enddate>19890201</enddate><creator>GALLO, G</creator><creator>GRIGORIADIS, M. D</creator><creator>TARJAN, R. E</creator><general>Society for Industrial and Applied Mathematics</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7RQ</scope><scope>7WY</scope><scope>7WZ</scope><scope>7X2</scope><scope>7XB</scope><scope>87Z</scope><scope>88A</scope><scope>88F</scope><scope>88I</scope><scope>88K</scope><scope>8AL</scope><scope>8FE</scope><scope>8FG</scope><scope>8FH</scope><scope>8FK</scope><scope>8FL</scope><scope>8G5</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>ATCPS</scope><scope>AZQEC</scope><scope>BBNVY</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>BHPHI</scope><scope>CCPQU</scope><scope>D1I</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>GUQSH</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>KB.</scope><scope>L.-</scope><scope>L6V</scope><scope>LK8</scope><scope>M0C</scope><scope>M0K</scope><scope>M0N</scope><scope>M1Q</scope><scope>M2O</scope><scope>M2P</scope><scope>M2T</scope><scope>M7P</scope><scope>M7S</scope><scope>MBDVC</scope><scope>P5Z</scope><scope>P62</scope><scope>PATMY</scope><scope>PDBOC</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PTHSS</scope><scope>PYCSY</scope><scope>Q9U</scope><scope>S0W</scope><scope>U9A</scope></search><sort><creationdate>19890201</creationdate><title>A fast parametric maximum flow algorithm and applications</title><author>GALLO, G ; GRIGORIADIS, M. D ; TARJAN, R. E</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c345t-fdf4181f4927b779123ecb6468b9b94bdbab00ada5fdddf707cfcd50502d178e3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1989</creationdate><topic>Algorithms</topic><topic>Applied sciences</topic><topic>Computer science</topic><topic>Exact sciences and technology</topic><topic>Flows in networks. Combinatorial problems</topic><topic>Labeling</topic><topic>Linear programming</topic><topic>Mathematical functions</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><topic>Optimization</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>GALLO, G</creatorcontrib><creatorcontrib>GRIGORIADIS, M. D</creatorcontrib><creatorcontrib>TARJAN, R. E</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Career & Technical Education Database</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>Agricultural Science Collection</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Biology Database (Alumni Edition)</collection><collection>Military Database (Alumni Edition)</collection><collection>Science Database (Alumni Edition)</collection><collection>Telecommunications (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Natural Science Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>Research Library (Alumni Edition)</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>Agricultural & Environmental Science Collection</collection><collection>ProQuest Central Essentials</collection><collection>Biological Science Collection</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>Natural Science Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Materials Science Collection</collection><collection>ProQuest Central Korea</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>Research Library Prep</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>Materials Science Database</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ProQuest Engineering Collection</collection><collection>ProQuest Biological Science Collection</collection><collection>ABI/INFORM Global</collection><collection>Agricultural Science Database</collection><collection>Computing Database</collection><collection>Military Database</collection><collection>Research Library</collection><collection>Science Database</collection><collection>Telecommunications Database</collection><collection>Biological Science Database</collection><collection>Engineering Database</collection><collection>Research Library (Corporate)</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>Environmental Science Database</collection><collection>Materials Science Collection</collection><collection>ProQuest One Business</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>Engineering Collection</collection><collection>Environmental Science Collection</collection><collection>ProQuest Central Basic</collection><collection>DELNET Engineering & Technology Collection</collection><jtitle>SIAM journal on computing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>GALLO, G</au><au>GRIGORIADIS, M. D</au><au>TARJAN, R. E</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A fast parametric maximum flow algorithm and applications</atitle><jtitle>SIAM journal on computing</jtitle><date>1989-02-01</date><risdate>1989</risdate><volume>18</volume><issue>1</issue><spage>30</spage><epage>55</epage><pages>30-55</pages><issn>0097-5397</issn><eissn>1095-7111</eissn><abstract>The classical maximum flow problem sometimes occurs in settings in which the arc capacities are not fixed but are functions of a single parameter, and the goal is to find the value of the parameter such that the corresponding maximum flow or minimum cut satisfies some side condition. Finding the desired parameter value requires solving a sequence of related maximum flow problems. In this paper it is shown that the recent maximum flow algorithm of Goldberg and Tarjan can be extended to solve an important class of such parametric maximum flow problems, at the cost of only a constant factor in its worst-case time bound. Faster algorithms for a variety of combinatorial optimization problems follow from the result.</abstract><cop>Philadelphia, PA</cop><pub>Society for Industrial and Applied Mathematics</pub><doi>10.1137/0218003</doi><tpages>26</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0097-5397 |
| ispartof | SIAM journal on computing, 1989-02, Vol.18 (1), p.30-55 |
| issn | 0097-5397 1095-7111 |
| language | eng |
| recordid | cdi_proquest_journals_919784319 |
| source | SIAM Journals Online |
| subjects | Algorithms Applied sciences Computer science Exact sciences and technology Flows in networks. Combinatorial problems Labeling Linear programming Mathematical functions Operational research and scientific management Operational research. Management science Optimization |
| title | A fast parametric maximum flow algorithm and applications |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-09T06%3A57%3A07IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20fast%20parametric%20maximum%20flow%20algorithm%20and%20applications&rft.jtitle=SIAM%20journal%20on%20computing&rft.au=GALLO,%20G&rft.date=1989-02-01&rft.volume=18&rft.issue=1&rft.spage=30&rft.epage=55&rft.pages=30-55&rft.issn=0097-5397&rft.eissn=1095-7111&rft_id=info:doi/10.1137/0218003&rft_dat=%3Cproquest_cross%3E2578271171%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=919784319&rft_id=info:pmid/&rfr_iscdi=true |