Results 1  10
of
228,543
An Auction Algorithm for the MaxFlow Problem
, 1995
"... We propose a new algorithm for the maxflow problem. It consists of a sequence of augmentations along paths constructed by an auctionlike algorithm. These paths are not necessarily shortest, that is, they need not contain a minimum number of arcs. However, they can be found typically with much les ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
We propose a new algorithm for the maxflow problem. It consists of a sequence of augmentations along paths constructed by an auctionlike algorithm. These paths are not necessarily shortest, that is, they need not contain a minimum number of arcs. However, they can be found typically with much
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
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
Brief announcement: better speedups for parallel maxflow
 In Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures
, 2011
"... We present a parallel solution to the MaximumFlow (MaxFlow) problem, suitable for a modern manycore architecture. We show that by starting from a PRAM algorithm, following an established “programmer’s workflow ” and targeting XMT, a PRAMinspired manycore architecture, we achieve significantly ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We present a parallel solution to the MaximumFlow (MaxFlow) problem, suitable for a modern manycore architecture. We show that by starting from a PRAM algorithm, following an established “programmer’s workflow ” and targeting XMT, a PRAMinspired manycore architecture, we achieve
Geographic maxflow and mincut under a circular disk failure model
 MASSACHUSETTS INSTITUTE OF TECHNOLOGY, EE, TECH. REP
, 2012
"... Failures in fiberoptic networks may be caused by natural disasters, such as floods or earthquakes, as well as other events, such as an Electromagnetic Pulse (EMP) attack. These events occur in specific geographical locations, therefore the geography of the network determines the effect of failure ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
events on the network’s connectivity and capacity. In this paper we consider a generalization of the mincut and maxflow problems under a geographic failure model. Specifically, we consider the problem of finding the minimum number of failures, modeled as circular disks, to disconnect a pair of nodes
Max flows in O(nm) time, or better
, 2012
"... In this paper, we present improved polynomial time algorithms for the max flow problem defined on a network with n nodes and m arcs. We show how to solve the max flow problem in O(nm) time, improving upon the best previous algorithm due to King, Rao, and Tarjan, who solved the max flow problem in O( ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
In this paper, we present improved polynomial time algorithms for the max flow problem defined on a network with n nodes and m arcs. We show how to solve the max flow problem in O(nm) time, improving upon the best previous algorithm due to King, Rao, and Tarjan, who solved the max flow problem in O
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
A MaxFlow Approach for Improving Robustness in a Spacecraft Downlink Schedule
 IN PROCEEDINGS OF THE 4 TH INTERNATIONAL WORKSHOP ON PLANNING AND SCHEDULING FOR SPACE, IWPSS’04
, 2004
"... In the realm of scheduling problems different sources of uncertainty can invalidate the solutions. In this paper we are concerned with the generation of high quality downlink schedules in a spacecraft domain in presence of a high degree of uncertainty. In particular, we refer to a combinatorial opt ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
or the channel data rate. This work describes a reduction of the MEXMDP to a MaxFlow problem, such that the problem has a solution when the maximum flow equates the total amount of data to dump. Based on this reduction, an iterative procedure is built to improve the robustness of a solution with respect
Consensus Problems in Networks of Agents with Switching Topology and TimeDelays
, 2003
"... In this paper, we discuss consensus problems for a network of dynamic agents with fixed and switching topologies. We analyze three cases: i) networks with switching topology and no timedelays, ii) networks with fixed topology and communication timedelays, and iii) maxconsensus problems (or leader ..."
Abstract

Cited by 1112 (21 self)
 Add to MetaCart
In this paper, we discuss consensus problems for a network of dynamic agents with fixed and switching topologies. We analyze three cases: i) networks with switching topology and no timedelays, ii) networks with fixed topology and communication timedelays, and iii) maxconsensus problems (or
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 1967 (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
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 160 (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
Results 1  10
of
228,543