Network Flows

By Ravindra K. Ahuja, T. Magnanti, James B. Orlin. 2011

1,204 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/66c4f1e80d367e49cf8cd9be3a15595cdf88e49e

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

In Computer Networks and Communications

Citations in the corpus

The Algorithm Design Manual (2020, methodology): “See [AMO93] for a history of algorithms for the problem.”
Robust Online Multi-object Tracking Based on Tracklet Confidence and Online Discriminative Appearance Learning (2014, methodology): “We then determine tracklet-detection pairs using the Hungarian algorithm [1] such that the total affinity in Sh×n is maximized.”
An introduction to Total Variation for Image Analysis (2009, methodology): “In [72], it is proposed to use simple LP-relaxation exactly as for the multiway cut problem in the discrete literature [1].”
Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs (2010, background): “Combinatorial Optimization, Volume A. Number 24 in Algorithms and Combinatorics.”
Spatial Networks (2010, background): “Optimization is however of great importance in many practical engineering problems and both the problem of optimal networks [180] and of optimal traffic on a network [4, 309] have a long tradition in mathematics and physics.”
An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations (2013, background): “These problems lie at the core of of graph algorithms and combinatorial optimization and have been extensively studied for over the past 60 years [26, 1].”
An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs , and its Multicommodity Generalizations (2013, background): “These problems lie at the core of of graph algorithms and combinatorial optimization and have been extensively studied for over the past 60 years [26] [1].”
Max flows in O(nm) time, or better (2013, background): “A comprehensive discussion of such algorithms and applications can be found in [1].”
Proximal Methods for Hierarchical Sparse Coding (2010, neutral): “chical structure among the atoms of D, where this structure is assumed to be known beforehand. The precise meaning of hierarchical 1. A tree is deﬁned as a connected graph that contains no cycle (see Ahuja et al., 1993). 2 PROXIMAL METHODS FOR HIERARCHICAL SPARSE CODING structure and the deﬁnition o”