# Item

ITEM ACTIONSEXPORT

Released

Report

#### Maximum network flow with floating point arithmetic

##### MPS-Authors

##### Locator

There are no locators available

##### Fulltext (public)

1997-1-022

(Any fulltext), 10KB

##### Supplementary Material (public)

There is no public supplementary material available

##### Citation

Althaus, E., & Mehlhorn, K.(1997). *Maximum network flow
with floating point arithmetic* (MPI-I-1997-1-022). Saarbrücken: Max-Planck-Institut für Informatik.

Cite as: http://hdl.handle.net/11858/00-001M-0000-0014-9D72-9

##### Abstract

We discuss the implementation of network flow algorithms in floating point
arithmetic. We give an example to illustrate the difficulties that may arise
when floating point arithmetic is used without care. We describe an iterative
improvement scheme that can be put around any network flow algorithm for
integer capacities. The scheme carefully scales the capacities such that all
integers arising can be handled exactly using floating point arithmetic.
For $m \le 10^9$ and double precision floating
point arithmetic the number of iterations is always bounded by three and the
relative error in the flow value is at most $2^{-19}$. For $m \le 10^6$ and
double precision arithmetic the relative error after the first iteration is
bounded by $10^{-3}$.