Pages that link to "Item:Q2933631"
From MaRDI portal
The following pages link to Distributed algorithms for multicommodity flow problems via approximate steepest descent framework (Q2933631):
Displaying 3 items.
- Nearly linear-time packing and covering LP solvers. Nearly linear-time packing and covering LP solvers, achieving width-independence and \(=(1/\varepsilon)\)-convergence (Q2414908) (← links)
- Near-Optimal Distributed Maximum Flow (Q4561245) (← links)
- A distributed dual ascent algorithm for Steiner problems in multicast routing (Q5191138) (← links)