Results 11  20
of
228,159
Incremental Algorithms for Some Network Flow Problems
, 2001
"... In many network flow problems an incremental algorithm yields an enormous saving in computation time. The goal of such an algorithm is to update the solution to an instance of a problem after a unit change is made in the input. In this thesis the maxflow problem and shortest path problem are consid ..."
Abstract
 Add to MetaCart
In many network flow problems an incremental algorithm yields an enormous saving in computation time. The goal of such an algorithm is to update the solution to an instance of a problem after a unit change is made in the input. In this thesis the maxflow problem and shortest path problem
Fall 2008 ��
"... Today we continue our discussion of maximum flows by introducing the fattest path augmenting algorithm, an improvement over the FordFulkerson algorithm, to solve the max flow problem. We also discuss the minimum cost circulation problem. ..."
Abstract
 Add to MetaCart
Today we continue our discussion of maximum flows by introducing the fattest path augmenting algorithm, an improvement over the FordFulkerson algorithm, to solve the max flow problem. We also discuss the minimum cost circulation problem.
Optimal Webscale Tiering as a Flow Problem
, 2010
"... We present a fast online solver for large scale parametric maxflow problems as they occur in portfolio optimization, inventory management, computer vision, and logistics. Our algorithm solves an integer linear program in an online fashion. It exploits total unimodularity of the constraint matrix an ..."
Abstract
 Add to MetaCart
We present a fast online solver for large scale parametric maxflow problems as they occur in portfolio optimization, inventory management, computer vision, and logistics. Our algorithm solves an integer linear program in an online fashion. It exploits total unimodularity of the constraint matrix
The Complexity of Multiterminal Cuts
 SIAM Journal on Computing
, 1994
"... In the Multiterminal Cut problem we are given an edgeweighted graph and a subset of the vertices called terminals, and asked for a minimum weight set of edges that separates each terminal from all the others. When the number k of terminals is two, this is simply the mincut, maxflow problem, and ..."
Abstract

Cited by 194 (0 self)
 Add to MetaCart
In the Multiterminal Cut problem we are given an edgeweighted graph and a subset of the vertices called terminals, and asked for a minimum weight set of edges that separates each terminal from all the others. When the number k of terminals is two, this is simply the mincut, maxflow problem
Offer Shai*
, 2004
"... This paper expands the use of network flows to the multidimensional case, in which network flows are associated with vectors, instead of the conventionally used scalar values. A method for solving a multidimensional maxflow problem is systematically developed, on the basis of the primaldual algori ..."
Abstract
 Add to MetaCart
This paper expands the use of network flows to the multidimensional case, in which network flows are associated with vectors, instead of the conventionally used scalar values. A method for solving a multidimensional maxflow problem is systematically developed, on the basis of the primal
A continuous maxflow approach to Potts model
 In European Conference on Computer Vision (ECCV), Iraklion
, 2010
"... Abstract. We address the continuous problem of assigning multiple (unordered) labels with the minimum perimeter. The corresponding discrete Potts model is typically addressed with aexpansion which can generate metrication artifacts. Existing convex continuous formulations of the Potts model use TV ..."
Abstract

Cited by 18 (3 self)
 Add to MetaCart
based functionals directly encoding perimeter costs. Such formulations are analogous to ’mincut ’ problems on graphs. We propose a novel convex formulation with a continous ’maxflow ’ functional. This approach is dual to the standard TVbased formulations of the Potts model. Our continous maxflow approach has
Power Transmission Control Using Distributed MaxFlow
 PROCEEDINGS OF THE 29 TH INTERNATIONAL COMPUTERS, SOFTWARE, AND APPLICATIONS CONFERENCE
, 2005
"... Existing maximum flow algorithms use one processor for all calculations or one processor per vertex in a graph to calculate the maximum possible flow through a graph’s vertices. This is not suitable for practical implementation. We extend the maxflow work of Goldberg and Tarjan to a distributed al ..."
Abstract

Cited by 12 (5 self)
 Add to MetaCart
Existing maximum flow algorithms use one processor for all calculations or one processor per vertex in a graph to calculate the maximum possible flow through a graph’s vertices. This is not suitable for practical implementation. We extend the maxflow work of Goldberg and Tarjan to a distributed
MaxFlow Protection using Network Coding
"... In this paper we present a new way to enhance the survivability of the information flow between two communicating nodes S and T without compromising the maximum achievable ST information rate. To do this, bottleneck links should only forward useful information, and not redundant data units. We int ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
introduce the idea of extra source or destination connectivity with respect to a certain ST maxflow, and then we introduce two problems: namely, precut protection and postcut protection. Because of space limitations we only focus on the precut protection problem. Specifically, we show that the precut
Experimental evaluation of parametric maxflow algorithms
 In WEA ’07: Proceedings of the 6th Workshop on Experimental Algorithms
, 2007
"... Abstract. The parametric maximum flow problem is an extension of the classical maximum flow problem in which the capacities of certain arcs are not fixed but are functions of a single parameter. Gallo et al. [6] showed that certain versions of the pushrelabel algorithm for ordinary maximum flow can ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
Abstract. The parametric maximum flow problem is an extension of the classical maximum flow problem in which the capacities of certain arcs are not fixed but are functions of a single parameter. Gallo et al. [6] showed that certain versions of the pushrelabel algorithm for ordinary maximum flow
EHRHART CLUTTERS: REGULARITY AND MAXFLOW MINCUT
, 2010
"... If C is a clutter with n vertices and q edges whose clutter matrix has column vectors A = {v1,...,vq}, we call C an Ehrhart clutter if {(v1,1),...,(vq,1)} ⊂ {0,1} n+1 is a Hilbert basis. Letting A(P) be the Ehrhart ring of P = conv(A), we are able to show that if C is a uniform unmixed MFMC clutter ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
clutter, then C is an Ehrhart clutter and in this case we provide sharp upper bounds on the CastelnuovoMumford regularity and the ainvariant of A(P). Motivated by the ConfortiCornuéjols conjecture on packing problems, we conjecture that if C is both ideal and the clique clutter of a perfect graph
Results 11  20
of
228,159