Results 11  20
of
396,822
Network information flow
 IEEE TRANS. INFORM. THEORY
, 2000
"... We introduce a new class of problems called network information flow which is inspired by computer network applications. Consider a pointtopoint communication network on which a number of information sources are to be mulitcast to certain sets of destinations. We assume that the information source ..."
Abstract

Cited by 1961 (24 self)
 Add to MetaCart
coding rate region. Our result can be regarded as the Maxflow Mincut Theorem for network information flow. Contrary to one’s intuition, our work reveals that it is in general not optimal to regard the information to be multicast as a “fluid” which can simply be routed or replicated. Rather
Theoretical improvements in algorithmic efficiency for network flow problems

, 1972
"... This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem, and the general minimumcost flow problem. Upper bounds on ... the numbers of steps in these algorithms are derived, and are shown to compale favorably with upper bounds on the numbers of steps req ..."
Abstract

Cited by 565 (0 self)
 Add to MetaCart
This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem, and the general minimumcost flow problem. Upper bounds on ... the numbers of steps in these algorithms are derived, and are shown to compale favorably with upper bounds on the numbers of steps
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.
Approximate MaxFlow Min(multi)cut Theorems and Their Applications
 SIAM Journal on Computing
, 1993
"... Consider the multicommodity flow problem in which the object is to maximize the sum of commodities routed. We prove the following approximate maxflow minmulticut theorem: min multicut O(logk) max flow min multicut; where k is the number of commodities. Our proof is constructive; it enables us ..."
Abstract

Cited by 161 (3 self)
 Add to MetaCart
Consider the multicommodity flow problem in which the object is to maximize the sum of commodities routed. We prove the following approximate maxflow minmulticut theorem: min multicut O(logk) max flow min multicut; where k is the number of commodities. Our proof is constructive; it enables us
Use of MaxFlow on FACTS Devices
 In Proceedings of the 39th Annual North American Power Symposium
"... Abstract—FACTS devices can be used to mitigate cascading failures in a power grid by controlling the power flow in individual lines. Placement and control are significant issues. We present a procedure for determining whether a scenario can be mitigated using the concept of maximum flow. If it can b ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
be mitigated, we determine what placement and control setting will solve the scenario. This paper treats fourteen cascading failure scenarios and reports on the use of the maxflow algorithm both in determining the mitigation of each scenario and in finding FACTS settings that will mitigate the scenario. Index
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
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
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
Results 11  20
of
396,822