skip to content
Efficiency of the Network Simplex Algorithm for the Maximum Flow Problem. Preview this item
ClosePreview this item
Checking...

Efficiency of the Network Simplex Algorithm for the Maximum Flow Problem.

Author: Andrew V Goldberg; Michael D Grigoriadis; Robert E Tarjan; PRINCETON UNIV NJ DEPT OF COMPUTER SCIENCE.
Publisher: Ft. Belvoir : Defense Technical Information Center, OCT 1988.
Edition/Format:   Book : EnglishView all editions and formats
Database:WorldCat
Summary:
Goldfarb and Hao have proposed a network simplex algorithm that will solve a maximum flow problem on an n-vertex, m-arc network in at most nm pivots and O(n squared m) time. In this paper we describe how to implement their algorithm to run in O(nmlog n) time by using an extension of the dynamic tree data structure of Sleator and Tarjan. This bound is less than a logarithmic factor larger than that of any other known  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: Andrew V Goldberg; Michael D Grigoriadis; Robert E Tarjan; PRINCETON UNIV NJ DEPT OF COMPUTER SCIENCE.
OCLC Number: 227751456
Description: 19 p. ; 23 x 29 cm.

Abstract:

Goldfarb and Hao have proposed a network simplex algorithm that will solve a maximum flow problem on an n-vertex, m-arc network in at most nm pivots and O(n squared m) time. In this paper we describe how to implement their algorithm to run in O(nmlog n) time by using an extension of the dynamic tree data structure of Sleator and Tarjan. This bound is less than a logarithmic factor larger than that of any other known algorithm for the problem. Keywords: Algorithms; Complexity; Data structures; Dynamic trees; Graphs; Linear programming; Maximum flow; Network flow; Network optimization.

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/227751456>
library:oclcnum"227751456"
library:placeOfPublication
library:placeOfPublication
rdf:typeschema:Book
schema:about
schema:about
schema:about
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"1988"
schema:datePublished"OCT 1988"
schema:description"Goldfarb and Hao have proposed a network simplex algorithm that will solve a maximum flow problem on an n-vertex, m-arc network in at most nm pivots and O(n squared m) time. In this paper we describe how to implement their algorithm to run in O(nmlog n) time by using an extension of the dynamic tree data structure of Sleator and Tarjan. This bound is less than a logarithmic factor larger than that of any other known algorithm for the problem. Keywords: Algorithms; Complexity; Data structures; Dynamic trees; Graphs; Linear programming; Maximum flow; Network flow; Network optimization."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/21482701>
schema:inLanguage"en"
schema:name"Efficiency of the Network Simplex Algorithm for the Maximum Flow Problem."@en
schema:numberOfPages"19"
schema:publication
schema:publisher
wdrs:describedby

Content-negotiable representations

Close Window

Please sign in to WorldCat 

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