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:   Print 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 pages ; 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


Primary Entity

<http://www.worldcat.org/oclc/227751456> # Efficiency of the Network Simplex Algorithm for the Maximum Flow Problem.
    a schema:Book, schema:CreativeWork ;
   library:oclcnum "227751456" ;
   library:placeOfPublication <http://id.loc.gov/vocabulary/countries/vau> ;
   library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/21482701#Place/ft_belvoir> ; # Ft. Belvoir
   schema:about <http://experiment.worldcat.org/entity/work/data/21482701#Topic/trees> ; # Trees
   schema:about <http://experiment.worldcat.org/entity/work/data/21482701#Topic/simplex_method> ; # Simplex method
   schema:about <http://experiment.worldcat.org/entity/work/data/21482701#Topic/graphs> ; # Graphs
   schema:about <http://experiment.worldcat.org/entity/work/data/21482701#Topic/data_bases> ; # Data bases
   schema:about <http://experiment.worldcat.org/entity/work/data/21482701#Topic/dynamics> ; # Dynamics
   schema:about <http://experiment.worldcat.org/entity/work/data/21482701#Topic/networks> ; # Networks
   schema:about <http://experiment.worldcat.org/entity/work/data/21482701#Topic/operations_research> ; # Operations research
   schema:about <http://experiment.worldcat.org/entity/work/data/21482701#Topic/algorithms> ; # Algorithms
   schema:about <http://experiment.worldcat.org/entity/work/data/21482701#Topic/network_flows> ; # Network flows
   schema:about <http://experiment.worldcat.org/entity/work/data/21482701#Topic/logarithm_functions> ; # Logarithm functions
   schema:about <http://experiment.worldcat.org/entity/work/data/21482701#Topic/problem_solving> ; # Problem solving
   schema:about <http://experiment.worldcat.org/entity/work/data/21482701#Topic/optimization> ; # Optimization
   schema:bookFormat bgn:PrintBook ;
   schema:contributor <http://viaf.org/viaf/73933029> ; # Robert E. Tarjan
   schema:contributor <http://experiment.worldcat.org/entity/work/data/21482701#Person/goldberg_andrew_v> ; # Andrew V. Goldberg
   schema:contributor <http://experiment.worldcat.org/entity/work/data/21482701#Organization/princeton_univ_nj_dept_of_computer_science> ; # PRINCETON UNIV NJ Dept. of COMPUTER SCIENCE.
   schema:contributor <http://experiment.worldcat.org/entity/work/data/21482701#Person/grigoriadis_michael_d> ; # Michael D. Grigoriadis
   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:productID "227751456" ;
   schema:publication <http://www.worldcat.org/title/-/oclc/227751456#PublicationEvent/ft_belvoir_defense_technical_information_center_oct_1988> ;
   schema:publisher <http://experiment.worldcat.org/entity/work/data/21482701#Agent/defense_technical_information_center> ; # Defense Technical Information Center
   wdrs:describedby <http://www.worldcat.org/title/-/oclc/227751456> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/21482701#Agent/defense_technical_information_center> # Defense Technical Information Center
    a bgn:Agent ;
   schema:name "Defense Technical Information Center" ;
    .

<http://experiment.worldcat.org/entity/work/data/21482701#Organization/princeton_univ_nj_dept_of_computer_science> # PRINCETON UNIV NJ Dept. of COMPUTER SCIENCE.
    a schema:Organization ;
   schema:name "PRINCETON UNIV NJ Dept. of COMPUTER SCIENCE." ;
    .

<http://experiment.worldcat.org/entity/work/data/21482701#Person/goldberg_andrew_v> # Andrew V. Goldberg
    a schema:Person ;
   schema:familyName "Goldberg" ;
   schema:givenName "Andrew V." ;
   schema:name "Andrew V. Goldberg" ;
    .

<http://experiment.worldcat.org/entity/work/data/21482701#Person/grigoriadis_michael_d> # Michael D. Grigoriadis
    a schema:Person ;
   schema:familyName "Grigoriadis" ;
   schema:givenName "Michael D." ;
   schema:name "Michael D. Grigoriadis" ;
    .

<http://experiment.worldcat.org/entity/work/data/21482701#Topic/logarithm_functions> # Logarithm functions
    a schema:Intangible ;
   schema:name "Logarithm functions"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/21482701#Topic/operations_research> # Operations research
    a schema:Intangible ;
   schema:name "Operations research"@en ;
    .

<http://viaf.org/viaf/73933029> # Robert E. Tarjan
    a schema:Person ;
   schema:familyName "Tarjan" ;
   schema:givenName "Robert E." ;
   schema:name "Robert E. Tarjan" ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

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