Pages that link to "Item:Q1373725"
From MaRDI portal
The following pages link to Fast deterministic approximation for the multicommodity flow problem (Q1373725):
Displaying 15 items.
- A combinatorial approximation algorithm for concurrent flow problem and its application (Q707017) (← links)
- A combinatorial approximation algorithm for supply chain network flow problem (Q884620) (← links)
- A fast polynomial time algorithm for logistics network flows (Q924394) (← links)
- Approximation algorithms for general packing problems and their application to the multicast congestion problem (Q925266) (← links)
- A fixed-parameter tractability result for multicommodity demand flow in trees (Q1045910) (← links)
- A natural randomization strategy for multicommodity flow and related algorithms (Q1198070) (← links)
- Approximate minimum-cost multicommodity flows in \(\widetilde O(\varepsilon^{-2}KNM)\) time (Q1363422) (← links)
- A matheuristic approach for the quickest multicommodity \(k\)-splittable flow problem (Q1651593) (← links)
- Speeding up Karmarkar's algorithm for multicommodity flows (Q1915810) (← links)
- Approximating fractional multicommodity flow independent of the number of commodities (Q2706182) (← links)
- Multicast Routing and Design of Sparse Connectors (Q3637320) (← links)
- Faster approximation schemes for fractional multicommodity flow problems (Q4962706) (← links)
- (Q5020878) (← links)
- Fast approximation of minimum multicast congestion – Implementation VERSUS Theory (Q5693011) (← links)
- Approximation and Online Algorithms (Q5896938) (← links)