Corpus ID: 5573697

Flow Rounding

@article{Kang2015FlowR,
  title={Flow Rounding},
  author={Donggu Kang and James Payor},
  journal={ArXiv},
  year={2015},
  volume={abs/1507.08139}
}
  • Donggu Kang, James Payor
  • Published 2015
  • Computer Science
  • ArXiv
  • 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. 

    Figures and Topics from this paper.

    Explore Further: Topics Discussed in This Paper

    References

    Publications referenced by this paper.
    SHOWING 1-8 OF 8 REFERENCES
    Provably good routing in graphs: regular arrays
    59
    Randomized rounding: A technique for provably good algorithms and algorithmic proofs
    883
    Optimal Rounding of Instantaneous Fractional Flows Over Time
    7
    Approximate Max-Flow on Small Depth Networks
    • E. Cohen
    • Mathematics, Computer Science
    • 1995
    9
    A new approach to computing maximum flows using electrical flows
    70
    Navigating Central Path with Electrical Flows: From Flows to Matchings, and Back
    • A. Madry
    • Computer Science, Mathematics
    • 2013
    168
    A data structure for dynamic trees
    772
    Finding minimum-cost circulations by canceling negative cycles
    197