Pith. sign in

REVIEW 1 cited by

Flow Rounding

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1507.08139 v1 pith:VDM2MOJR submitted 2015-07-29 cs.DS

Donggu Kang , James Payor This is my paper · ORCID
classification cs.DS
keywords flowroundingintegralfindfractionalalgorithmalongasks
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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(m \log(n^2/m))$ algorithm.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Breaking the O(mn)-Time Barrier for Vertex-Weighted Global Minimum Cut

    cs.DS 2025-06 accept novelty 8.0 of 10

    A randomized algorithm computes the weighted global minimum vertex-cut in O(min{mn^{0.99+o(1)}, m^{1.5+o(1)}}) time, breaking the long-standing O~(mn) barrier.

Pith tools