Results 1  10
of
361
An Experimental Comparison of MinCut/MaxFlow Algorithms for Energy Minimization in Vision
 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 2001
"... After [10, 15, 12, 2, 4] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in lowlevel vision. The combinatorial optimization literature provides many mincut/maxflow algorithms with different polynomial time compl ..."
Abstract

Cited by 1315 (53 self)
 Add to MetaCart
After [10, 15, 12, 2, 4] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in lowlevel vision. The combinatorial optimization literature provides many mincut/maxflow algorithms with different polynomial time
Multicommodity maxflow mincut theorems and their use in designing approximation algorithms
 J. ACM
, 1999
"... In this paper, we establish maxflow mincut theorems for several important classes of multicommodity flow problems. In particular, we show that for any nnode multicommodity flow problem with uniform demands, the maxflow for the problem is within an O(log n) factor of the upper bound implied by ..."
Abstract

Cited by 357 (6 self)
 Add to MetaCart
by the mincut. The result (which is existentially optimal) establishes an important analogue of the famous 1commodity maxflow mincut theorem for problems with multiple commodities. The result also has substantial applications to the field of approximation algorithms. For example, we use the flow result
An Approximate MaxFlow MinCut Theorem for Uniform Multicommodity Flow Problems with Applications to Approximation Algorithms
, 1989
"... In this paper, we consider a multicommodity flow problem where for each pair of vertices, (u,v), we are required to sendf halfunits of commodity (uv) from u to v and f halfunits of commodity (vu) from v to u without violating capacity constraints. Our main result is an algorithm for performing th9 ..."
Abstract

Cited by 246 (12 self)
 Add to MetaCart
In this paper, we consider a multicommodity flow problem where for each pair of vertices, (u,v), we are required to sendf halfunits of commodity (uv) from u to v and f halfunits of commodity (vu) from v to u without violating capacity constraints. Our main result is an algorithm for performing th
An O(log k) approximate mincut maxflow theorem and approximation algorithm
 SIAM J. COMPUT
, 1998
"... It is shown that the minimum cut ratio is within a factor of O(log k) of the maximum concurrent flow for kcommodity flow instances with arbitrary capacities and demands. This improves upon the previously bestknown bound of O(log 2 k) and is existentially tight, up to a constant factor. An algori ..."
Abstract

Cited by 129 (6 self)
 Add to MetaCart
. An algorithm for finding a cut with ratio within a factor of O(log k) of the maximum concurrent flow, and thus of the optimal mincut ratio, is presented.
A STUDY ON CONTINUOUS MAXFLOW AND MINCUT APPROACHES
"... We propose and investigate novel maxflow models in the spatially continuous setting, with or without supervised constraints, under a comparative study of graph based maxflow / mincut. We show that the continuous maxflow models correspond to their respective continuous mincut models as primal a ..."
Abstract

Cited by 23 (6 self)
 Add to MetaCart
. We prove that the associated nonconvex partitioning problems, unsupervised or supervised, can be solved globally and exactly via the proposed convex continuous maxflow and mincut models. Moreover, we derive novel fast maxflow based algorithms whose convergence can be guaranteed by standard
Bounds on the MaxFlow MinCut Ratio for Directed Multicommodity Flows
, 1993
"... The most wellknown theorem in combinatorial optimization is the classical maxflow mincut theorem of Ford and Fulkerson. This theorem serves as the basis for deriving efficient algorithms for finding maxflows and mincuts. Starting with the work of Leighton and Rao, significant effort was directe ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
The most wellknown theorem in combinatorial optimization is the classical maxflow mincut theorem of Ford and Fulkerson. This theorem serves as the basis for deriving efficient algorithms for finding maxflows and mincuts. Starting with the work of Leighton and Rao, significant effort
On the MaxFlow MinCut Ratio for Directed Multicommodity Flows
 Theor. Comput. Sci
, 2003
"... We give a pure combinatorial problem whose solution determines maxflow mincut ratio for directed multicommodity flows. In addition, this combinatorial problem has applications in improving the approximation factor of Greedy algorithm for maximum edge disjoint path problem. More precisely, our u ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
We give a pure combinatorial problem whose solution determines maxflow mincut ratio for directed multicommodity flows. In addition, this combinatorial problem has applications in improving the approximation factor of Greedy algorithm for maximum edge disjoint path problem. More precisely, our
AN APPROXIMATE MAXFLOW MINCUT RELATION FOR Undirected Multicommodity Flow, . . .
, 1995
"... In this paper, we prove the first approximate maxflow mincut theorem for undirected mult icommodity flow. We show that for a feasible flow to exist in a mult icommodity problem, it is sufficient hat every cut's capacity exceeds its demand by a factor of O(logClogD), where C is the sum of all ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
In this paper, we prove the first approximate maxflow mincut theorem for undirected mult icommodity flow. We show that for a feasible flow to exist in a mult icommodity problem, it is sufficient hat every cut's capacity exceeds its demand by a factor of O(logClogD), where C is the sum of all
MaxFlow MinCut Theorems for MultiUser Communication Networks
, 2011
"... Traditionally, communication networks are modeled and analyzed in terms of information flows in graphs. In this paper, we introduce a novel symbolic approach to communication networks, where the topology of the underlying network is contained in a set of formal terms from logic. In order to account ..."
Abstract
 Add to MetaCart
, there are information measures for which the maximum flow may not attend the mincut. Second, we derive a general principle for manytomany cast communications in dynamic multiuser networks. We prove that if each demand can be satisfied locally, then they can all be achieved globally, which happens when
Analysis and Optimization of Max Flow Mincut
"... Today we are working with the networks all around and that’s why it becomes very important to find the effective flow of the commodity within that network. This paper aims to provide an analysis of the best known algorithm for calculating maximum flow of any network and to propose an approximate alg ..."
Abstract
 Add to MetaCart
Today we are working with the networks all around and that’s why it becomes very important to find the effective flow of the commodity within that network. This paper aims to provide an analysis of the best known algorithm for calculating maximum flow of any network and to propose an approximate
Results 1  10
of
361