Algorithms and complexity analysis for some flow problems
type: Item
instance of: scholarly article
title: Algorithms and complexity analysis for some flow problems
zbMATH Open document ID: 0795.68100
DOI: 10.1007/BF01240739
author: Edith Cohen
author: Nimrod Megiddo
published in: Algorithmica
publication date: 1994-09-11T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 529945
zbMATH Keywords: parametric flow
zbMATH Keywords: constrained flow
zbMATH Keywords: strongly polynomial
zbMATH Keywords: linear- programming
MaRDI profile type: Publication
cites work: Complexity of some parametric integer and network programming problems
cites work: Strongly polynomial-time and NC algorithms for detecting cycles in periodic graphs
cites work: Q5624995
cites work: Linear programming is log-space hard for P
cites work: The complexity of linear programming
cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
cites work: Q3292914
cites work: A Fast Parametric Maximum Flow Algorithm and Applications
cites work: Q3273708
cites work: Q5603095
cites work: Q3352816
cites work: Parametric Combinatorial Computing and a Problem of Program Module Distribution
cites work: A generalization of max flow—min cut
cites work: Two-Commodity Flow
cites work: Q3048571
cites work: A good algorithm for lexicographically optimal flows in multi-terminal networks
cites work: Applying Parallel Computation Algorithms in the Design of Serial Algorithms
cites work: Towards a Genuinely Polynomial Algorithm for Linear Programming
cites work: Linear Programming in Linear Time When the Dimension Is Fixed
cites work: Q3138915
cites work: A strongly polynomial minimum cost circulation algorithm
cites work: A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
full work available at URL: https://doi.org/10.1007/bf01240739
OpenAlex ID: W3137940023
description: scientific article; zbMATH DE number 529945