The maximum concurrent flow problem
From MaRDI portal
Publication:3474283
Recommendations
- Approximation Algorithms for the Maximum Concurrent Flow Problem
- scientific article; zbMATH DE number 867664
- Faster Approximation Algorithms For the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts
- Max concurrent flow problem
- A combinatorial approximation algorithm for concurrent flow problem and its application
Cited in
(75)- Flows with unit path capacities and related packing and covering problems
- Ancestor tree for arbitrary multi-terminal cut functions
- Maximum concurrent flows and minimum cuts
- A linear time algorithm for graph partition problems
- A natural randomization strategy for multicommodity flow and related algorithms
- Path optimization for graph partitioning problems
- The permutation-path coloring problem on trees.
- Sparsest cuts and concurrent flows in product graphs.
- Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations
- Vertical perimeter versus horizontal perimeter
- Maximum concurrent flow with incomplete data
- Exponential penalty function control of loss networks
- Optimization with additional variables and constraints
- Upper bound of network capacity and a static optimal packet routing strategy
- On max-k-sums
- Asymptotic analysis of the flow deviation method for the maximum concurrent flow problem
- An approximate max-flow min-cut relation for undirected multicommodity flow, with applications
- Drawings of graphs on surfaces with few crossings
- Flows on measurable spaces
- Optimal flow and capacity allocation in multiple joint quickest paths of directed networks
- GMA: a Pareto optimal distributed resource-allocation algorithm
- A simple method for convex optimization in the oracle model
- Bounds on maximum concurrent flow in random bipartite graphs
- Improving an interior-point approach for large block-angular problems by hybrid preconditioners
- Maximum flow under proportional delay constraint
- Lexicographic maximin optimisation for fair bandwidth allocation in computer networks
- Polynomiality of sparsest cuts with fixed number of sources
- An interior-point approach for primal block-angular problems
- Dynamic maintenance of majority information in constant time per update
- A maximum multicommodity flow problem with global fair met rate
- On the Number of Iterations for Dantzig--Wolfe Optimization and Packing-Covering Approximation Algorithms
- A provably tight delay-driven concurrently congestion mitigating global routing algorithm
- K-splittable delay constrained routing problem: A branch-and-price approach
- Max concurrent flow problem
- The maximum flow problem with disjunctive constraints
- Multicast Routing and Design of Sparse Connectors
- scientific article; zbMATH DE number 3908126 (Why is no real title available?)
- Approximation Algorithms for the Maximum Concurrent Flow Problem
- Compression bounds for Lipschitz maps from the Heisenberg group to \(L_{1}\)
- scientific article; zbMATH DE number 1347106 (Why is no real title available?)
- Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
- On Canonical Concurrent Flows, Crossing Number and Graph Expansion
- scientific article; zbMATH DE number 6863577 (Why is no real title available?)
- Efficient algorithms for the maximum concurrent flow problem
- EFFICIENT APPROXIMATION ALGORITHMS FOR PAIRWISE DATA CLUSTERING AND APPLICATIONS
- scientific article; zbMATH DE number 867664 (Why is no real title available?)
- Multicommodity network flows: A survey. II: Solution methods
- From the physics of interacting polymers to optimizing routes on the London underground
- Playing with the Maximum-Flow Problem
- The Maximum Flow Problem for Oriented Flows
- Prolong the lifetime of wireless sensor networks through mobility: a general optimization framework
- Approximation algorithms and hardness of integral concurrent flow
- Faster min-max resource sharing in theory and practice
- Euclidean distortion and the sparsest cut
- Fast approximation of minimum multicast congestion – Implementation VERSUS Theory
- Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance
- Constructing integral uniform flows in symmetric networks with application to the edge-forwarding index problem
- Limit-saturated edges for the superconcurrent distribution of flows in networks.
- A network flow model of group technology
- Multi-core processor scheduling with respect to data bus bandwidth
- Concurrent flows and packet routing in Cayley graphs (Preliminary version)
- Dynamic reversible lane optimization in autonomous driving environments: balancing efficiency and safety
- Barrier subgradient method
- A simple method for convex optimization in the oracle model
- High-accuracy multicommodity flows via iterative refinement
- Resource sharing revisited: local weak duality and optimal convergence
- A combinatorial approximation algorithm for concurrent flow problem and its application
- Self-concordant barriers for convex approximations of structured convex sets
- O( n)-approximation algorithms for bipartiteness ratio
- Sparsest cuts and bottlenecks in graphs
- A fast heuristic algorithm for the maximum concurrent \(k\)-splittable flow problem
- A combinatorial approximation algorithm for supply chain network flow problem
- A fast polynomial time algorithm for logistics network flows
- An exact approach for the maximum concurrent \(k\)-splittable flow problem
- On the complexity of bandwidth allocation in radio networks
This page was built for publication: The maximum concurrent flow problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3474283)
