Sparse flow decomposition is reformulated as a convex fit over the flow polytope and solved with Frank-Wolfe, yielding fast, competitive reconstructions that do not require explicit path-count minimization.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Efficient Sparse Flow Decomposition Methods for RNA Multi-Assembly
Sparse flow decomposition is reformulated as a convex fit over the flow polytope and solved with Frank-Wolfe, yielding fast, competitive reconstructions that do not require explicit path-count minimization.