Summary
We present an efficient algorithm for scaling matrices and show how the algorithm can be applied to the minimum cycle mean problem.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aumann, G.: Über approximative Nomographie, I and II. Bayer. Akad. Wiss. Math.-Nat. Kl. S.B. (1958), 137–155. Ibid. Aumann, G.: Über approximative Nomographie, I and II. Bayer. Akad. Wiss. Math.-Nat. Kl. S.B. (1959), 103–109
Diliberto, S.P., Straus, E.G.: On the approximation of a function of several variables by the sum of functions of fewer variables. Pacific J. Math.1, 195–210 (1951)
Fulkerson, D.R., Wolfe, P.: An algorithm for scaling matrices. SIAM Rev.4, 142–146 (1962)
Golitschek, M. v., Cheney, E.W.: On the algorithm of Diliberto and Straus for approximating bivariate functions by univariate ones. Numer. Funct. Anal. and Optimiz.1, 341–363 (1979)
Karp, R.M.: A characterization of the minimum cycle mean in a digraph. Discrete Math.23, 309–311 (1978)
Rothblum, U.G., Schneider, H.: Characterizations of optimal scalings of matrices. Preprint, Report RS 2678 (1978)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
v. Golitschek, M. An algorithm for scaling matrices and computing the minimum cycle mean in a digraph. Numer. Math. 35, 45–55 (1980). https://doi.org/10.1007/BF01396369
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01396369