Approximate Minimum - Cost Multicommodity Flows in ~ O ( " � 2 Knm ) Time
نویسندگان
چکیده
We show that an "-approximate solution of the cost-constrained K-commodity ow problem on an N-nodeM-arc network G can be computed by sequentially solving O K(" 2 + logK) logM log(" 1 K) single-commodity minimum-cost ow problems on the same network. In particular, an approximate minimumcost multicommodity ow can be computed in ~ O(" 2 KNM) running time, where the notation ~ O( ) means \up to logarithmic factors". This result improves the time bound mentioned in Grigoriadis and Khachiyan (1994) by a factor of M=N and that developed recently in Karger and Plotkin (1995) by a factor of " 1 . We also provide a simple ~ O (NM)-time algorithm for singlecommodity budget-constrained minimum-cost ows which is ~ O " 3 times faster than the algorithm of Karger and Plotkin (1995). APPROXIMATE MINIMUM-COST MULTICOMMODITY FLOWS IN ~ O(" 2 KNM) TIME* Michael D. Grigoriadis and Leonid G. Khachiyan Department of Computer Science, Rutgers University, New Brunswick, NJ, USA
منابع مشابه
Optimal multicommodity flows in dynamic networks and algorithms for their finding
In this paper we study two basic problems related to dynamic flows: maximum multicommodity flow and the minimum cost multicommodity flow problems. We consider these problems on dynamic networks with time-varying capacities of edges. For minimum cost multicommodity flow problem we assume that cost functions, defined on edges, are nonlinear and depending on time and flow, and the demand function ...
متن کاملFaster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems
This paper considers the problem of designing fast, approximate, combinatorial algorithms for multicommodity flows and other fractional packing problems. We provide a different approach to these problems which yields faster and much simpler algorithms. Our approach also allows us to substitute shortest path computations for min-cost flow computations in computing maximum concurrent flow and min...
متن کاملMATHEMATICAL ENGINEERING TECHNICAL REPORTS An Algorithm for Minimum Cost Arc-Connectivity Orientations
Given a 2k-edge-connected undirected graph, we consider to find a minimum cost orientation that yields a k-arc-connected directed graph. This minimum cost k-arc-connected orientation problem is a special case of the submodular flow problem. Frank (1982) devised a combinatorial algorithm that solves the problem in O(knm) time, where n and m are the numbers of vertices and edges, respectively. Ga...
متن کاملApproximate duality of multicommodity multiroute flows and cuts: single source case
Given an integer h, a graph G = (V,E) with arbitrary positive edge capacities and k pairs of vertices (s1, t1), (s2, t2), . . . , (sk, tk), called terminals, an h-route cut is a set F ⊆ E of edges such that after the removal of the edges in F no pair si−ti is connected by h edge-disjoint paths (i.e., the connectivity of every si− ti pair is at most h− 1 in (V,E\F )). The h-route cut is a natura...
متن کاملAn Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations
In this paper, we introduce a new framework for approximately solving flow problems in capacitated, undirected graphs and apply it to provide asymptotically faster algorithms for the maximum s-t flow and maximum concurrent multicommodity flow problems. For graphs with n vertices and m edges, it allows us to find an ε-approximate maximum s-t flow in time O(m1+o(1)ε−2), improving on the previous ...
متن کامل