π
π
The Cartographer
Flow Rounding
July 29, 2015 Β· Declared Dead Β· π arXiv.org
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Donggu Kang, James Payor
arXiv ID
1507.08139
Category
cs.DS: Data Structures & Algorithms
Citations
20
Venue
arXiv.org
Last Checked
3 months ago
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.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Data Structures & Algorithms
R.I.P.
π»
Ghosted
Route Planning in Transportation Networks
R.I.P.
π»
Ghosted
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
R.I.P.
π»
Ghosted
Hierarchical Clustering: Objective Functions and Algorithms
R.I.P.
π»
Ghosted
Graph Isomorphism in Quasipolynomial Time
π
π
The Cartographer
Simulation optimization: A review of algorithms and applications
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted