Pages that link to "Item:Q3474283"

The following pages link to The maximum concurrent flow problem (Q3474283):

Displaying 44 items.

• Dynamic maintenance of majority information in constant time per update (Q287138) (← links)
• A provably tight delay-driven concurrently congestion mitigating global routing algorithm (Q299423) (← links)
• Compression bounds for Lipschitz maps from the Heisenberg group to \(L_{1}\) (Q416849) (← links)
• Faster min-max resource sharing in theory and practice (Q542051) (← links)
• A network flow model of group technology (Q597530) (← links)
• Barrier subgradient method (Q633113) (← 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)
• Sparsest cuts and bottlenecks in graphs (Q810053) (← links)
• A fast heuristic algorithm for the maximum concurrent \(k\)-splittable flow problem (Q845550) (← links)
• A combinatorial approximation algorithm for supply chain network flow problem (Q884620) (← links)
• A fast polynomial time algorithm for logistics network flows (Q924394) (← links)
• An exact approach for the maximum concurrent \(k\)-splittable flow problem (Q928300) (← 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)
• Ancestor tree for arbitrary multi-terminal cut functions (Q1179737) (← links)
• Maximum concurrent flows and minimum cuts (Q1194345) (← links)
• A linear time algorithm for graph partition problems (Q1198016) (← links)
• A natural randomization strategy for multicommodity flow and related algorithms (Q1198070) (← links)
• Path optimization for graph partitioning problems (Q1276954) (← links)
• The permutation-path coloring problem on trees. (Q1401295) (← links)
• Sparsest cuts and concurrent flows in product graphs. (Q1427176) (← links)
• Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations (Q1598763) (← links)
• Vertical perimeter versus horizontal perimeter (Q1643390) (← links)
• Exponential penalty function control of loss networks (Q1769408) (← links)
• Optimization with additional variables and constraints (Q1779712) (← links)
• Upper bound of network capacity and a static optimal packet routing strategy (Q1782676) (← links)
• On max-\(k\)-sums (Q1785208) (← links)
• An approximate max-flow min-cut relation for undirected multicommodity flow, with applications (Q1894701) (← links)
• Drawings of graphs on surfaces with few crossings (Q1920424) (← links)
• Flows on measurable spaces (Q2041865) (← links)
• Optimal flow and capacity allocation in multiple joint quickest paths of directed networks (Q2108154) (← links)
• GMA: a Pareto optimal distributed resource-allocation algorithm (Q2117732) (← links)
• A simple method for convex optimization in the oracle model (Q2164690) (← links)
• Bounds on maximum concurrent flow in random bipartite graphs (Q2228396) (← links)
• Improving an interior-point approach for large block-angular problems by hybrid preconditioners (Q2356092) (← links)
• Lexicographic maximin optimisation for fair bandwidth allocation in computer networks (Q2455638) (← links)
• Polynomiality of sparsest cuts with fixed number of sources (Q2467444) (← links)
• An interior-point approach for primal block-angular problems (Q2643610) (← links)
• On the Number of Iterations for Dantzig--Wolfe Optimization and Packing-Covering Approximation Algorithms (Q2944569) (← links)
• <i>k</i> -Splittable delay constrained routing problem: A branch-and-price approach (Q3057130) (← links)
• From the physics of interacting polymers to optimizing routes on the London Underground (Q5170973) (← links)
• Fast approximation of minimum multicast congestion – Implementation VERSUS Theory (Q5693011) (← links)
• Dynamic reversible lane optimization in autonomous driving environments: balancing efficiency and safety (Q6189812) (← links)