WorldCat Linked Data Explorer

Turtle N-Triple JSON-LD RDF/XML HTML Contact Us Home

http://worldcat.org/entity/work/id/21482701

Efficiency of the Network Simplex Algorithm for the Maximum Flow Problem

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[superscript 2]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."

Open All Close All

type

about

http://schema.org/about

author

contributor

creator

description

http://schema.org/description

  • "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[superscript 2]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.""@en
  • "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 0(n²m) time. In this paper we describe how to implement their algorithm to run in 0(nm log 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."@en
  • "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
  • "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(n2m) time. In this paper we describe how to implement their algorithm to run in O(nm log 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."@en

name

http://schema.org/name

  • "Efficiency of the Network Simplex Algorithm for the Maximum Flow Problem"@en
  • "Efficiency of the network simplex algorithm for the maximum flow problem"@en
  • "Efficiency of the network simplex algorithm for the maximum flow problem"

workExample