English

Flow Rounding

Data Structures and Algorithms 2015-07-30 v1

Abstract

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(mlog(n2/m))O(m \log(n^2/m)) algorithm.

Keywords

Cite

@article{arxiv.1507.08139,
  title  = {Flow Rounding},
  author = {Donggu Kang and James Payor},
  journal= {arXiv preprint arXiv:1507.08139},
  year   = {2015}
}

Comments

10 pages, 3 figures

R2 v1 2026-06-22T10:21:32.131Z