A new saling algorithm for the maximum mean cut problem
type: Item
instance of: scholarly article
title: A new saling algorithm for the maximum mean cut problem
zbMATH Open document ID: 0793.68116
DOI: 10.1007/BF01240735
author: Kazuo Iwano
author: Shinji Misono
author: Shu Tezuka
author: Satoru Fujishige
published in: Algorithmica
publication date: 1994-04-17T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 529941
zbMATH Keywords: maximum mean
zbMATH Keywords: scaling algorithm
zbMATH Keywords: circulation feasibility
zbMATH Keywords: minimum-cost circulation
zbMATH Keywords: binary search
MaRDI profile type: Publication
cites work: A Fast and Simple Algorithm for the Maximum Flow Problem
cites work: Improved Time Bounds for the Maximum Flow Problem
cites work: Q5624995
cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
cites work: A new approach to the maximum-flow problem
cites work: Finding minimum-cost circulations by canceling negative cycles
cites work: Q3751390
cites work: A characterization of the minimum cycle mean in a digraph
cites work: Combinatorial optimization. Networks and matroids
cites work: Q5516084
cites work: A Fast Algorithm for Optimally Increasing the Edge Connectivity
cites work: New scaling algorithms for the assignment and minimum mean cycle problems
cites work: A linear time randomizing algorithm for searching ranked functions
full work available at URL: https://doi.org/10.1007/bf01240735
OpenAlex ID: W2090219729
description: scientific article; zbMATH DE number 529941