A new polynomial-time algorithm for linear programming
Combinatorica
Data structures and network algorithms
Data structures and network algorithms
A strongly polynomial algorithm to solve combinatorial linear programs
Operations Research
Planar multicommodity flows, maximum matchings and negative cycles
SIAM Journal on Computing
Concurrent flow and concurrent connectivity on graphs
Graph theory with applications to algorithms and computer science
Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Interprocessor Traffic Scheduling Algorithm for Multiple-Processor Networks
IEEE Transactions on Computers
On solving large maximum concurrent flow problems
CSC '87 Proceedings of the 15th annual conference on Computer Science
Two flow routing algorithms for the maximum concurrent flow problem
ACM '86 Proceedings of 1986 ACM Fall joint computer conference
Algorithms for Network Programming
Algorithms for Network Programming
Fast approximation algorithms for multicommodity flow problems
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Faster algorithms for finding small edge cuts in planar graphs
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
A parallel randomized approximation scheme for shortest paths
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
On-line load balancing with applications to machine scheduling and virtual circuit routing
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Excluded minors, network decomposition, and multicommodity flow
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Efficient approximation algorithms for semidefinite programs arising from MAX CUT and COLORING
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Strategic directions in research in theory of computing
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
On-line routing of virtual circuits with applications to load balancing and machine scheduling
Journal of the ACM (JACM)
A probabilistic multicommodity-flow solution to circuit clustering problems
ICCAD '92 Proceedings of the 1992 IEEE/ACM international conference on Computer-aided design
Randomized rounding without solving the linear program
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Path optimization and near-greedy analysis for graph partitioning: an empirical study
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Finding near-optimal cuts: an empirical evaluation
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Fast deterministic approximation for the multicommodity flow problem
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Fast approximation algorithm for minimum cost multicommodity flow
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Routing and admission control in general topology networks with Poisson arrivals
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Fast approximate graph partitioning algorithms
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Journal of the ACM (JACM)
Datapath routing based on a decongestion metric
ISPD '00 Proceedings of the 2000 international symposium on Physical design
Faster approximation schemes for fractional multicommodity flow problems
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Embedding k-outerplanar graphs into ℓ1
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Experimental Evaluation of Approximation Algorithms for Single-Source Unsplittable Flow
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
A New Min-Cut Max-Flow Ratio for Multicommodity Flows
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Second-Order Methods for Distributed Approximate Single- and Multicommodity Flow
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Throughput-centric routing algorithm design
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Approximating Fractional Multicommodity Flow Independent of the Number of Commodities
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Proceedings of the 9th annual international conference on Mobile computing and networking
Sparsest cuts and concurrent flows in product graphs
Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
A fast approximation scheme for fractional covering problems with variable upper bounds
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Expander flows, geometric embeddings and graph partitioning
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Solving fractional packing problems in Oast(1/ε) iterations
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Accurate and efficient flow based congestion estimation in floorplanning
Proceedings of the 2004 Asia and South Pacific Design Automation Conference
Stochastic Networks: Admission and Routing Using Penalty Functions
Queueing Systems: Theory and Applications
Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Characterizing achievable rates in multi-hop wireless mesh networks with orthogonal channels
IEEE/ACM Transactions on Networking (TON)
The Y-architecture: yet another on-chip interconnect solution
ASP-DAC '03 Proceedings of the 2003 Asia and South Pacific Design Automation Conference
A combinatorial approximation algorithm for concurrent flow problem and its application
Computers and Operations Research
Optimizing yield in global routing
Proceedings of the 2006 IEEE/ACM international conference on Computer-aided design
Lexicographically Minimum and Maximum Load Linear Programming Problems
Operations Research
An interior-point approach for primal block-angular problems
Computational Optimization and Applications
Faster approximation schemes for fractional multicommodity flow problems
ACM Transactions on Algorithms (TALG)
Scheduling bulk file transfers with start and end times
Computer Networks: The International Journal of Computer and Telecommunications Networking
Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut
ACM Transactions on Algorithms (TALG)
On the complexity of bandwidth allocation in radio networks
Theoretical Computer Science
Energy and switch area optimizations for FPGA global routing architectures
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Expander flows, geometric embeddings and graph partitioning
Journal of the ACM (JACM)
Lifetime maximization for connected target coverage in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Centralized and distributed algorithms for routing and weighted max-min fair bandwidth allocation
IEEE/ACM Transactions on Networking (TON)
Proceedings of the forty-first annual ACM symposium on Theory of computing
Oblivious routing of highly variable traffic in service overlays and IP backbones
IEEE/ACM Transactions on Networking (TON)
Multicast Routing and Design of Sparse Connectors
Algorithmics of Large and Complex Networks
Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles
Pairwise data clustering and applications
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Fast approximation of minimum multicast congestion: implementation versus theory
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
A nondifferentiable optimization approach to ratio-cut partitioning
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
Proceedings of the forty-second ACM symposium on Theory of computing
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Two-tier wireless mesh networks dimensioning
WD'09 Proceedings of the 2nd IFIP conference on Wireless days
Interference aware resource allocation for hybrid hierarchical wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
NetEx: efficient and cost-effective internet bulk content delivery
Proceedings of the 6th ACM/IEEE Symposium on Architectures for Networking and Communications Systems
$O(\sqrt{\logn})$ Approximation to SPARSEST CUT in $\tilde{O}(n^2)$ Time
SIAM Journal on Computing
IEEE/ACM Transactions on Networking (TON)
Load-aware multicast routing metrics in multi-radio multi-channel wireless mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Inter-datacenter bulk transfers with netstitcher
Proceedings of the ACM SIGCOMM 2011 conference
Traffic-oblivious routing in the hose model
IEEE/ACM Transactions on Networking (TON)
Throughput-competitive advance reservation with bounded path dispersion
IEEE/ACM Transactions on Networking (TON)
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Distributed resource allocation in stream processing systems
DISC'06 Proceedings of the 20th international conference on Distributed Computing
A network flow model of group technology
Mathematical and Computer Modelling: An International Journal
Active graph reachability reduction for network security and software engineering
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Polynomiality of sparsest cuts with fixed number of sources
Operations Research Letters
Content placement via the exponential potential function method
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
Proceedings of the sixth ACM conference on Security and privacy in wireless and mobile networks
A PRG for lipschitz functions of polynomials with applications to sparsest cut
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Network-aware impact determination algorithms for service workflow deployment in hybrid clouds
Proceedings of the 8th International Conference on Network and Service Management
| Hi-index | 0.01 |
The maximum concurrent flow problem (MCFP) is a multicommodity flow problem in which every pair of entities can send and receive flow concurrently. The ratio of the flow supplied between a pair of entities to the predefined demand for that pair is called throughput and must be the same for all pairs of entities for a concurrent flow. The MCFP objective is to maximize the throughput, subject to the capacity constraints. We develop a fully polynomial-time approximation scheme for the MCFP for the case of arbitrary demands and uniform capacity. Computational results are presented. It is shown that the problem of associating costs (distances) to the edges so as to maximize the minimum-cost of routing the concurrent flow is the dual of the MCFP. A path-cut type duality theorem to expose the combinatorial structure of the MCFP is also derived. Our duality theorems are proved constructively for arbitrary demands and uniform capacity using the algorithm. Applications include packet-switched networks [1, 4, 8], and cluster analysis [16].