Pages that link to "Item:Q1363422"
From MaRDI portal
The following pages link to Approximate minimum-cost multicommodity flows in \(\widetilde O(\varepsilon^{-2}KNM)\) time (Q1363422):
Displaying 16 items.
- Barrier subgradient method (Q633113) (← links)
- Approximation algorithms for general packing problems and their application to the multicast congestion problem (Q925266) (← links)
- Scientific contributions of Leo Khachiyan (a short overview) (Q944704) (← links)
- Flows with unit path capacities and related packing and covering problems (Q1041430) (← links)
- A natural randomization strategy for multicommodity flow and related algorithms (Q1198070) (← links)
- Fast deterministic approximation for the multicommodity flow problem (Q1373725) (← links)
- A penalty function heuristic for the resource constrained shortest path problem (Q1848355) (← links)
- Fast approximation algorithms for multicommodity flow problems (Q1892218) (← links)
- On the complexity and approximability of budget-constrained minimum cost flows (Q2361495) (← links)
- A scaling algorithm for multicommodity flow problems (Q2781151) (← links)
- Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks (Q2817640) (← links)
- Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms (Q2875138) (← links)
- Efficient Primal-Dual Graph Algorithms for MapReduce (Q2945274) (← links)
- Multicast Routing and Design of Sparse Connectors (Q3637320) (← links)
- (Q5020878) (← links)
- Fast and simple approximation schemes for generalized flow. (Q5957564) (← links)