Pages that link to "Item:Q2706182"

The following pages link to Approximating Fractional Multicommodity Flow Independent of the Number of Commodities (Q2706182):

Displaying 16 items.

• 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)
• Costly circuits, submodular schedules and approximate Carathéodory theorems (Q1649974) (← 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)
• 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)
• (Q5240194) (← links)
• Optimization in telecommunication networks (Q5313481) (← links)
• Scalable timing-aware network design via Lagrangian decomposition (Q6112744) (← links)