Back to Results
First PageMeta Content
Operations research / Combinatorial optimization / Maximum flow problem / Gradient descent / Flow network / Graph / Max-flow min-cut theorem / Lipschitz continuity / Function / Mathematics / Numerical analysis / Network flow


An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations Jonathan A. Kelner
Add to Reading List

Document Date: 2013-04-08 19:53:37

Open Document

File Size: 556,19 KB

Share Result on Facebook

Company

LG / BT / Vertex / /

/

Event

Product Issues / Product Recall / /

IndustryTerm

deterministic algorithms / theoretical and practical applications / faster algorithms / iterative algorithm / linear time algorithm / gradient descent algorithm / polylogarithmic approximation algorithms / graph algorithms / linear systems / provable algorithms / /

Organization

MIT / /

Person

Aaron Sidford / Jonathan A. Kelner / Jonah Sherman / Lorenzo Orecchia / /

Position

Preliminaries General / /

Product

Laplacian / /

Technology

graph algorithms / deterministic algorithms / resulting algorithm / Their algorithm / graph G. Iterative algorithms / linear time algorithm / iterative algorithm / gradient descent algorithm / asymptotically faster algorithms / polylogarithmic approximation algorithms / /

SocialTag