Pages that link to "Item:Q4962706"
From MaRDI portal
The following pages link to Faster approximation schemes for fractional multicommodity flow problems (Q4962706):
Displaying 8 items.
- A generalized approximation framework for fractional network flow and packing problems (Q684147) (← links)
- On fractional multicommodity flows and distance functions (Q1119950) (← links)
- Approximation guarantees of algorithms for fractional optimization problems arising in dispatching rules for INDS problems (Q2399489) (← links)
- Efficient computation of optimal energy and fractional weighted flow trade-off schedules (Q2408929) (← links)
- Approximating fractional multicommodity flow independent of the number of commodities (Q2706182) (← links)
- Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms (Q2875138) (← links)
- Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules (Q2965472) (← links)
- Scalable timing-aware network design via Lagrangian decomposition (Q6112744) (← links)
