Matrix scaling by network flow

Authors:
Günter Rote;Martin Zachariasen
Affiliations:
Freie Universität Berlin, Institut für Informatik, Takustraße, Berlin, Germany;University of Copenhagen, Universitetsparken, Copenhagen Ø, Denmark
Venue:
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Year:
2007

Citing 4
Cited 3

A data structure for dynamic trees

Journal of Computer and System Sciences
Algorithms for proportional matrices in reals and integers

Mathematical Programming: Series A and B
Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications

SIAM Journal on Computing
Combinatorial optimization

Combinatorial optimization

Divisor-Based Biproportional Apportionment in Electoral Systems: A Real-Life Benchmark Study

Management Science
Parametric maximum flow methods for minimax approximation of target quotas in biproportional apportionment

Networks
Minimum ratio cover of matrix columns by extreme rays of its induced cone

ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization

Quantified Score

Hi-index	0.02

Visualization

Abstract

A given nonnegative n x n matrix A = (aij) is to be scaled, by multiplying its rows and columns by unknown positive multipliers λi and μj, such that the resulting matrix (aijλiμj) has specified row and column sums ri and sj. We give an algorithm that achieves the desired row and column sums with a maximum absolute error ε in O(n4(log n + log h/ε)) steps, where h is the overall total of the result matrix. Our algorithm is a scaling algorithm. It solves a sequence of more and more refined discretizations. The discretizations are minimum-cost network flow problems with convex piecewise linear costs. These discretizations are interesting in their own right because they arise in proportional elections.