Improved time bounds for the maximum flow problem

Improved time bounds for the maximum flow problem

Show other versions (1)

Bibliographic Details
Main Authors:	Ahuja, Ravindra K., Orlin, James B., Tarjan, Robert E.
Other Authors:	Sloan School of Management.
Format:	Working Paper
Published:	Cambridge, Mass. : Massachusetts Institute of Technology, Sloan School of Management, Massachusetts Institute of Technology 2009
Online Access:	http://hdl.handle.net/1721.1/48196

Similar Items

Improved time bounds for the maximum flow problem
by: Ahuja, Ravindra K., et al.
Published: (2009)

A fast and simple algorithm for the maximum flow problem
by: Ahuja, Ravindra K., et al.
Published: (2009)

A fast and simple algorithm for the maximum flow problem
by: Ahuja, Ravindra K., et al.
Published: (2009)

Improved time bounds for the maximum flow problem
Published: (2004)

Improved primal simplex algorithms for shortest path, assignment and minimum cost flow problems
by: Ahuja, Ravindra K., et al.
Published: (2009)

Inverse spanning tree problems : formulations and algorithms
by: Sokkalingam, P. T., et al.
Published: (2009)

Network flows
by: Ahuja, Ravindra K., et al.
Published: (2009)

A fast maximum flow algorithm
by: Orlin, James B, et al.
Published: (2021)

Exact and Heuristic Methods for the Weapon Target Assignment Problem
by: Ahuja, Ravindra K., et al.
Published: (2004)

Network Flows
by: Ahuja, Ravindra K., 1956-, et al.
Published: (2004)

Exact and Heuristic Methods for the Weapon Target Assignment Problem
by: Ahuja, Ravindra, et al.
Published: (2004)

VERY LARGE-SCALE NEIGHBORHOOD SEARCH FOR THE QUADRATIC ASSIGNMENT PROBLEM
by: Ahuja, Ravindra, et al.
Published: (2003)

Sensitivity Analysis for Shortest Path Problems and Maximum Capacity Path Problems in Undirected Graphs
by: Ramaswamy, Ramkumar, et al.
Published: (2004)

Some Recent Advances in Network Flows
by: Ahuja, Ravindra K., 1956-, et al.
Published: (2004)

DYNAMIC SHORTEST PATHS MINIMIZING TRAVEL TIMES AND COSTS
by: Ahuja, Ravindra, et al.
Published: (2003)

Sensitivity Analysis for Shortest Path Problems and Maximum Capacity Path Problems in Undirected Graphs
by: Ramaswamy, Ramkumar, et al.
Published: (2004)

SOLVING REAL-LIFE LOCOMOTIVE SCHEDULING PROBLEMS
by: Ahuja, Ravindra, et al.
Published: (2003)

New distance-directed algorithms for maximum flow and parametric maximum flow problems
Published: (2003)

Faster algorithms for the shortest path problem
by: Ahuja, Ravindra K.
Published: (2009)

The Complexity of the Maximum Network Flow Problem
by: Baratz, Alan Edward
Published: (2023)

Max flows in O(nm) time, or better
by: Orlin, James B
Published: (2014)

Faster parametric shortest path and minimum balance algorithms
by: Young, Neal E., et al.
Published: (2009)

A scaling algorithm for multicommodity flow problems
by: Schneur, Rina., et al.
Published: (2009)

Finding minimum-cost flows by double scaling
by: Ahuja, Ravindra K.
Published: (2009)

Genuinely polynomial simplex and non-simplex algorithms for the minimum cost flow problem
by: Orlin, James B.
Published: (2009)

OPTIC FLOW SEGMENTATION AS AN ILL-POSED AND MAXIMUM-LIKELIHOOD PROBLEM
by: Buxton, B, et al.
Published: (1985)

PTAS for maximum weight independent set problem with random weights in bounded degree graphs
by: Gamarnik, David, et al.
Published: (2012)

A fast and simple algorithm for the maximum flow problem
Published: (2004)

A capacity scaling algorithm for the constrained maximum flow problem
Published: (2003)

Equivalence of primal and dual simplex algorithms for the maximum flow problem
Published: (2003)

Improved bounds for the graham-pollak problem for hypergraphs
by: Leader, Imre, et al.
Published: (2018)

Maximum Marking Problems
by: Bird, R
Published: (2001)

Acyclic improper colourings of graphs with bounded maximum degree
by: Addario-Berry, L, et al.
Published: (2010)

A Very Large-Scale Neighborhood Search Algorithm for the Combined Through and Fleet Assignment Model
by: Ahuja, Ravindra, et al.
Published: (2003)

On the complexity of four polyhedral set containment problems
by: Freund, Robert Michael, et al.
Published: (2009)

Nonlinear programming and the maximum principle for discrete time optimal control problems
Published: (2004)

Decentralized maximum flow algorithms
Published: (2002)

Bounds in the restricted Burnside problem
by: Vaughan-Lee, M, et al.
Published: (1999)

Improved Algorithms for Computing Fisher's Market Clearing Prices
by: Orlin, James B.
Published: (2012)

Computing Maximum Flow with Augmenting Electrical Flows
by: Madry, Aleksander
Published: (2017)