Pages that link to "Item:Q2706182"
From MaRDI portal
The following pages link to Approximating fractional multicommodity flow independent of the number of commodities (Q2706182):
Displaying 27 items.
- Algorithms for multiplayer multicommodity flow problems (Q301120) (← links)
- Faster min-max resource sharing in theory and practice (Q542051) (← links)
- Short length Menger's theorem and reliable optical routing (Q557907) (← links)
- A generalized approximation framework for fractional network flow and packing problems (Q684147) (← links)
- Multiobjective optimization: Improved FPTAS for shortest paths and nonlinear objectives with applications (Q841630) (← links)
- Pricing for fairness: distributed resource allocation for multiple objectives (Q973022) (← links)
- Packing trees in communication networks (Q1016048) (← links)
- Flows with unit path capacities and related packing and covering problems (Q1041430) (← links)
- On fractional multicommodity flows and distance functions (Q1119950) (← links)
- Fast deterministic approximation for the multicommodity flow problem (Q1373725) (← links)
- Costly circuits, submodular schedules and approximate Carathéodory theorems (Q1649974) (← links)
- Asymptotic analysis of the flow deviation method for the maximum concurrent flow problem (Q1849528) (← links)
- Fast approximation algorithms for multicommodity flow problems (Q1892218) (← links)
- 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)
- Metric inequalities and the network loading problem (Q2471279) (← links)
- Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms (Q2875138) (← links)
- A maximum multicommodity flow problem with global fair met rate (Q2885689) (← links)
- Algorithms for Finding Optimal Flows in Dynamic Networks (Q2974407) (← links)
- Linear Programming in the Semi-streaming Model with Application to the Maximum Matching Problem (Q3012945) (← links)
- On three approaches to length-bounded maximum multicommodity flow with unit edge-lengths (Q3388417) (← links)
- (Almost) Tight bounds and existence theorems for single-commodity confluent flows (Q3546347) (← links)
- (Q5020878) (← links)
- Hardness Results for Structured Linear Systems (Q5117379) (← links)
- Routing of electric vehicles: constrained shortest path problems with resource recovering nodes (Q5240194) (← links)
- Optimization in telecommunication networks (Q5313481) (← links)
- Fast and simple approximation schemes for generalized flow. (Q5957564) (← links)
- Scalable timing-aware network design via Lagrangian decomposition (Q6112744) (← links)
