# Flow Rounding

@article{Kang2015FlowR, title={Flow Rounding}, author={Donggu Kang and James Payor}, journal={ArXiv}, year={2015}, volume={abs/1507.08139} }

We consider flow rounding: finding an integral flow from a fractional flow. Costed flow rounding asks that we find an integral flow with no worse cost. Randomized flow rounding requires we randomly find an integral flow such that the expected flow along each edge matches the fractional flow. Both problems are reduced to cycle canceling, for which we develop an O(m log n 2 m ) algorithm.

5 Citations

Maximum Integer Flows in Directed Planar Graphs with Multiple Sources and Sinks and Vertex Capacities

- Computer Science, Mathematics
- 2018

$O(N^3)$ Measurement Cost for Variational Quantum Eigensolver on Molecular Hamiltonians

- Physics, Mathematics
- 2019

13

#### References

##### Publications referenced by this paper.

SHOWING 1-8 OF 8 REFERENCES

Randomized rounding: A technique for provably good algorithms and algorithmic proofs

- Mathematics, Computer Science
- 1987

883

Navigating Central Path with Electrical Flows: From Flows to Matchings, and Back

- Computer Science, Mathematics
- 2013

168