Advertisement

A Linear-Time Algorithm for Minimum Cost Flow on Undirected One-Trees

  • Bahman Kalantari
  • Iraj Kalantari
Part of the Mathematics and Its Applications book series (MAIA, volume 329)

Abstract

We give an O(n)-time algorithm for the minimum cost flow problem over an undirected one-tree with n vertices. A one-tree is a spanning tree with one additional edge.

Keywords

Span Tree Undirected Graph Time Algorithm Minimum Cost Flow Network Simplex 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    P. Bloomfield and W.L. Steiger, Least Absolute Deviation, Theory, Application, and Algorithms(Birkhauser, 1983)Google Scholar
  2. [2]
    M. Blum, R.W. Floyd, V.R. Pratt, R.L. Rivest, and R.E. Tarjan, Time bounds for selection, Computer and System Sciences 7 (1972) 448–461.MathSciNetCrossRefGoogle Scholar
  3. [3]
    V. Chvatal, Linear Programming ( W.H. Freeman and Co., 1983 ).Google Scholar
  4. [4]
    M.E. Dyer, Linear time algorithms for two- and three-variable linear programs, SIAM J. Comput. 13 (1984) 31–45.MathSciNetzbMATHCrossRefGoogle Scholar
  5. [5]
    J. Edmonds and R.M. Karp, Theoretical improvements in algorithmic efficiency for network flow problem, J. ACM 19 (1972) 248–264.zbMATHCrossRefGoogle Scholar
  6. [6]
    Z. Galil and E. Tardos, An O(n 2 (m + n log n)log n) min-cost flow algorithm, Proc. 27th Annual Sympos. of Found, of Comp. Sci. (1986) 1–9.Google Scholar
  7. [7]
    A.V. Goldberg and R.E. Tarjan, Solving minimum cost flow problem by successive approximation, Proc. 19th ACM Sympos. on the Theory of Computing (1987) 7–18.Google Scholar
  8. [8]
    A.V. Goldberg and R.E. Tarjan, Finding minimum-cost circulation by canceling negative cycles, Proc. 20th ACM Sympos. on the Theory of Computing (1988) 388–397.Google Scholar
  9. [9]
    M.D. Grigoriadis, An efficient implementation of the network simplex method, Mathematical Programming Study 26 (1986) 83–111.MathSciNetzbMATHGoogle Scholar
  10. [10]
    M. Held and R. Karp, The traveling salesman problem and minimum spanning trees, Operations Research 18 (1970) 1138–1162.MathSciNetzbMATHCrossRefGoogle Scholar
  11. [11]
    N. Megiddo, Linear-time algorithms for linear programming in R3 and related problems, SIAM J. Comput. 12 (1983) 759–776.MathSciNetzbMATHCrossRefGoogle Scholar
  12. [12]
    J. Orlin, A faster strongly polynomial minimum cost flow algorithm, Proc. 20th ACM Sympos. on the Theory of Computing (1988) 377–387.Google Scholar
  13. [13]
    E. Tardos, A strongly polynomial minimum cost circulation algorithm, Combinatorica, 5 (1985) 247–255.MathSciNetzbMATHCrossRefGoogle Scholar
  14. [14]
    M. Werman, S. Peleg, R. Melter, and T.Y. Kong, Bipartite graph matching for points on a line or a circle, Journal of Algorithms 7 (1986) 277–284.MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Kluwer Academic Publishers 1995

Authors and Affiliations

  • Bahman Kalantari
    • 1
  • Iraj Kalantari
    • 2
  1. 1.Department of Computer ScienceRutgers UniversityNew BrunswickUSA
  2. 2.Department of MathematicsWestern Illinois UniversityMacombUSA

Personalised recommendations