Improving time bounds on maximum generalised flow computations by contracting the network
type: Item
instance of: scholarly article
title: Improving time bounds on maximum generalised flow computations by contracting the network
zbMATH Open document ID: 1071.90010
DOI: 10.1016/S0304-3975(03)00403-1
author: Tomasz Radzik
published in: Theoretical Computer Science
publication date: 2004-10-27T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 2110971
zbMATH Keywords: Network flows
zbMATH Keywords: Generalised flows
zbMATH Keywords: Flows with gains and losses
MaRDI profile type: Publication
cites work: Q3056948
cites work: Q5514188
cites work: Combinatorial Algorithms for the Generalized Circulation Problem
cites work: Finding Minimum-Cost Circulations by Successive Approximation
cites work: A Faster Combinatorial Algorithm for the Generalized Circulation Problem
cites work: Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized Circulation Problem
cites work: Q4886084
cites work: Speeding up Karmarkar's algorithm for multicommodity flows
cites work: Optimum flows in general communication networks
cites work: Faster algorithms for the generalized network flow problem
cites work: Self-adjusting binary search trees
cites work: Q3840368
cites work: A polynomial combinatorial algorithm for generalized minimum cost flow
full work available at URL: s0304-3975(03)00403-1
OpenAlex ID: W1506071578
description: scientific article; zbMATH DE number 2110971