Results 1  10
of
396,822
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
"... Abstract. 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 imp ..."
Abstract

Cited by 370 (6 self)
 Add to MetaCart
Abstract. 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
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
"... Abstract—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 ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
of failure 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
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 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 1311 (54 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
Hierarchical maxflow routing
 In Proc. of the IEEE GLOBECOM
, 2005
"... Abstract — This paper describes a technique to reduce the computational complexity of maxflow routing, based on a hierarchical decomposition of the network. The computational complexity of this hierarchical maxflow routing is comparable to that of Dijkstra’s and BellmanFord’s algorithms. It is sh ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
Abstract — This paper describes a technique to reduce the computational complexity of maxflow routing, based on a hierarchical decomposition of the network. The computational complexity of this hierarchical maxflow routing is comparable to that of Dijkstra’s and BellmanFord’s algorithms
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
"... Abstract. 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 combina ..."
Abstract

Cited by 2 (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
The Hungarian method for the assignment problem
 Naval Res. Logist. Quart
, 1955
"... Assuming that numerical scores are available for the performance of each of n persons on each of n jobs, the "assignment problem" is the quest for an assignment of persons to jobs so that the sum of the n scores so obtained is as large as possible. It is shown that ideas latent in the work ..."
Abstract

Cited by 1238 (0 self)
 Add to MetaCart
Assuming that numerical scores are available for the performance of each of n persons on each of n jobs, the "assignment problem" is the quest for an assignment of persons to jobs so that the sum of the n scores so obtained is as large as possible. It is shown that ideas latent
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 1052 (17 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
Results 1  10
of
396,822