Decentralized maximum flow algorithms

Decentralized maximum flow algorithms

"May 1979."

Bibliographic Details
Other Authors:	Segall, Adrian.
Language:	eng
Published:	Laboratory for Information and Decision Systems, Massachusetts Institute of Technology 2002
Subjects:	TK7855.M41 E3845 no.915 Network analysis (Planning) Algorithms
Online Access:	http://hdl.handle.net/1721.1/913

Similar Items

A nonparametric training algorithm for decentralized binary hypothesis testing networks
Published: (2003)

Decentralized detection
Published: (2003)

On synthesizing partially decentralized controllers
Published: (2003)

On synthesizing robust decentralized controllers
Published: (2003)

On threshold rules in decentralized detection
Published: (2003)

The specification and verification of systolic wave algorithms
Published: (2002)

On the throughput of channel access algorithms with limited sensing
Published: (2003)

Distributed asynchronous deterministic and stochastic gradient optimization algorithms
Published: (2002)

Optimal recursive maximum likelihood estimation
Published: (2003)

Capital accumulation in a stochastic decentralized economyy
Published: (2002)

An iterative coordination approach to decentralized decision problems
Published: (2002)

Some properties of optimal thresholds in decentralized detection
Published: (2003)

Decentralized detection by a large number of sensors
Published: (2003)

A unified framework for primal-dual methods in minimum cost network flow problems
Published: (2003)

Explicit solutions for some simple decentralized detection problems
Published: (2003)

The time complexity of maximum matching by simulated annealing
Published: (2003)

Maximum a-Posteriori estimation of random fields.
Published: (2003)

An auction algorithm for the max-flow problem
Published: (2003)

Identification and filtering--optimal recursive maximum likelihood approach
Published: (2003)

Minimization of the maximum peak-to-peak gain--the general multiblock problem
Published: (2003)

Certainty equivalent solutions of quadratic team problems by a decentralized innovations approach
Published: (2002)

Connection between unimodular interaction constraint for decentralized controllers and small gain bounds
Published: (2003)

An efficient maximum entropy technique for 2-D isotropic random fields
Published: (2003)

An efficient maximum entropy technique for 2-D isotropic random fields
Published: (2003)

The auction algorithm for assignment and other network flow problems
Published: (2003)

The auction algorithm for the minimum cost network flow problem
Published: (2003)

Auction algorithms for network flow problems : a tutorial introduction
Published: (2003)

Auction algorithms for network flow problems : a tutorial introduction
Published: (2003)

Partially asynchronous, parallel algorithms for network flow and other problems
Published: (2003)

A generic auction algorithm for the minimum cost network flow problem
Published: (2003)

Second derivative algorithms for minimum delay distributed routing in networks
Published: (2002)

Second derivative algorithms for minimum delay distributed routing in networks
Published: (2002)

Shortest route algorithms for sparsely connected networks
Published: (2002)

An auction/sequential shortest path algorithm for the minimum cost network flow problem
Published: (2003)

Mathematical equivalence of the auction algorithm for assignment and the e-relaxation (preflow-push) method for min cost flow
Published: (2003)

Maximum a-posteriori estimation of random fields : Part I, elliptic Gaussian fields observed via a noisy nonlinear channel
Published: (2003)

Generation and termination of binary decision trees for nonparametric multiclass classification S. Gelfand, S.K. Mitter.
Published: (2002)

A distributed algoritm for minimum weight directed spanning trees
Published: (2003)

Sufficient statistics for decentralized estimation
Published: (2003)

A distributed shortest path protocol
Published: (2002)