Pages that link to "Item:Q1892218"

The following pages link to Fast approximation algorithms for multicommodity flow problems (Q1892218):

Displaying 48 items.

• Algorithms for multiplayer multicommodity flow problems (Q301120) (← links)
• Primal-dual approximation algorithms for integral flow and multicut in trees (Q679443) (← links)
• A combinatorial approximation algorithm for concurrent flow problem and its application (Q707017) (← links)
• Self-concordant barriers for convex approximations of structured convex sets (Q707744) (← links)
• Approximation algorithms for treewidth (Q848843) (← links)
• A combinatorial approximation algorithm for supply chain network flow problem (Q884620) (← links)
• A fast polynomial time algorithm for logistics network flows (Q924394) (← links)
• On the complexity of bandwidth allocation in radio networks (Q952444) (← 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)
• The forwarding index of communication networks with given connectivity (Q1199420) (← links)
• Approximate minimum-cost multicommodity flows in \(\widetilde O(\varepsilon^{-2}KNM)\) time (Q1363422) (← links)
• Fast deterministic approximation for the multicommodity flow problem (Q1373725) (← links)
• An augmented Lagrangian algorithm for large scale multicommodity routing (Q1424783) (← links)
• Costly circuits, submodular schedules and approximate Carathéodory theorems (Q1649974) (← links)
• A matheuristic approach for the quickest multicommodity \(k\)-splittable flow problem (Q1651593) (← links)
• Speeding up Karmarkar's algorithm for multicommodity flows (Q1915810) (← links)
• Drawings of graphs on surfaces with few crossings (Q1920424) (← links)
• On complexity, representation and approximation of integral multicommodity flows (Q1962043) (← links)
• Heterogeneous flow distribution at the peak load in the multiuser network (Q2171298) (← links)
• Greedy distributed optimization of multi-commodity flows (Q2377262) (← links)
• Analysis of the load distribution and internodal flows under different routing strategies in a multiuser network (Q2695089) (← links)
• Approximating fractional multicommodity flow independent of the number of commodities (Q2706182) (← 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)
• On the Number of Iterations for Dantzig--Wolfe Optimization and Packing-Covering Approximation Algorithms (Q2944569) (← links)
• Optimal Multicommodity Flow Through the Complete Graph with Random Edge Capacities (Q3550999) (← links)
• Multicast Routing and Design of Sparse Connectors (Q3637320) (← links)
• Computing and Combinatorics (Q4681168) (← links)
• Probabilistic Analysis of Network Flow Algorithms (Q4697084) (← links)
• EFFICIENT APPROXIMATION ALGORITHMS FOR PAIRWISE DATA CLUSTERING AND APPLICATIONS (Q4818598) (← links)
• Fast Approximation Algorithms for Fractional Packing and Covering Problems (Q4848416) (← links)
• Improved approximations for the minimum-cut ratio and the flux (Q4866679) (← links)
• Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications (Q4877516) (← links)
• Faster approximation schemes for fractional multicommodity flow problems (Q4962706) (← links)
• Area-convexity, l _∞ regularization, and undirected multicommodity flow (Q4977993) (← links)
• (Q5020878) (← links)
• Hardness Results for Structured Linear Systems (Q5117379) (← links)
• Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size (Q5171158) (← links)
• Optimization in telecommunication networks (Q5313481) (← links)
• An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations (Q5383975) (← links)
• The maximum congested cut problem and its robust counterpart: Exact and approximation algorithms for the single and the multicommodity case (Q5449665) (← links)
• Fast approximation of minimum multicast congestion – Implementation VERSUS Theory (Q5693011) (← links)
• Uniform multicommodity flows in the hypercube with random edge‐capacities (Q5739099) (← links)
• Approximation and Online Algorithms (Q5896938) (← links)
• Algorithms - ESA 2003 (Q5897290) (← links)
• Constructing integral uniform flows in symmetric networks with application to the edge-forwarding index problem (Q5928874) (← links)
• Fast and simple approximation schemes for generalized flow. (Q5957564) (← links)