skip to content
A Fast Parametric Maximum Flow Algorithm. Revision. Preview this item
ClosePreview this item
Checking...

A Fast Parametric Maximum Flow Algorithm. Revision.

Author: Giorgio Gallo; Michael D Grigoriadis; Robert E Tarjan; PRINCETON UNIV NJ DEPT OF COMPUTER SCIENCE.
Publisher: Ft. Belvoir Defense Technical Information Center JUL 1987.
Edition/Format:   Book : EnglishView all editions and formats
Database:WorldCat
Summary:
The classical maximum flow problem sometimes occurs in settings in which the capacities are not fixed but are functions of a single parameters, 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. We shoe that the recent maximum flow  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: Giorgio Gallo; Michael D Grigoriadis; Robert E Tarjan; PRINCETON UNIV NJ DEPT OF COMPUTER SCIENCE.
OCLC Number: 227718874
Notes: Revision of report dated Nov 86.
Description: 42 p.

Abstract:

The classical maximum flow problem sometimes occurs in settings in which the capacities are not fixed but are functions of a single parameters, 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. We shoe 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 combinational optimization problems follow from our result. Keywords: Algorithms; Data structures; Graphs; Maximum glow; Network flows; Networks.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/227718874>
library:oclcnum"227718874"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/227718874>
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:contributor
schema:contributor
schema:contributor
schema:contributor
schema:datePublished"1987"
schema:datePublished"JUL 1987"
schema:description"The classical maximum flow problem sometimes occurs in settings in which the capacities are not fixed but are functions of a single parameters, 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. We shoe 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 combinational optimization problems follow from our result. Keywords: Algorithms; Data structures; Graphs; Maximum glow; Network flows; Networks."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/17722266>
schema:inLanguage"en"
schema:name"A Fast Parametric Maximum Flow Algorithm. Revision."@en
schema:numberOfPages"42"
schema:publisher
schema:url

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.