A new scaling algorithm for the maximum mean cut problem

Kazuo Iwano, Shinji Misono, Shu Tezuka, Satoru Fujishige

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

We present a new scaling algorithm for the maximum mean cut problem. The mean of a cut is defined by the cut capacity divided by the number of arcs crossing the cut. The algorithm uses an approximate binary search and solves the circulation feasibility problem with relaxed capacity bounds. The maximum mean cut problem has recently been studied as a dual analogue of the minimum mean cycle problem in the framework of the minimum cost flow problem by Ervolina and McCormick. A network N=(G, lower, upper) with lower and upper arc capacities is said to be δ-feasible if N has a feasible circulation when we relax the capacity bounds by δ; that is, we use (lower(a)- δ, upper(a)+δ) bounds instead of (lower(a), upper(a)) bounds for each arc a εA. During an approximate binary search we maintain two bounds, LB and UB, such that N is LB-infeasible and UB-feasible, and we reduce the interval size (LB, UB) by at least one-third at each iteration. For a graph with n vertices, m arcs, and integer capacities bounded by U, the running time of this algorithm is O(mn log(nU). This time bound is better than the time achieved by McCormick and Ervolina under the similarity condition (that is, U=O(no(1))). Our algorithm can be naturally used for the circulation feasibility problem, and thus provides a new scaling algorithm for the minimum cut problem.

Original languageEnglish
Pages (from-to)243-255
Number of pages13
JournalAlgorithmica
Volume11
Issue number3
DOIs
Publication statusPublished - Mar 1 1994

Fingerprint

Scaling
Arc of a curve
Binary search
Minimum Cost Flow
Minimum Cut
Analogue
Iteration
Cycle
Costs
Interval
Integer
Graph in graph theory

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Computer Science Applications
  • Applied Mathematics

Cite this

Iwano, K., Misono, S., Tezuka, S., & Fujishige, S. (1994). A new scaling algorithm for the maximum mean cut problem. Algorithmica, 11(3), 243-255. https://doi.org/10.1007/BF01240735

A new scaling algorithm for the maximum mean cut problem. / Iwano, Kazuo; Misono, Shinji; Tezuka, Shu; Fujishige, Satoru.

In: Algorithmica, Vol. 11, No. 3, 01.03.1994, p. 243-255.

Research output: Contribution to journalArticle

Iwano, K, Misono, S, Tezuka, S & Fujishige, S 1994, 'A new scaling algorithm for the maximum mean cut problem', Algorithmica, vol. 11, no. 3, pp. 243-255. https://doi.org/10.1007/BF01240735
Iwano K, Misono S, Tezuka S, Fujishige S. A new scaling algorithm for the maximum mean cut problem. Algorithmica. 1994 Mar 1;11(3):243-255. https://doi.org/10.1007/BF01240735
Iwano, Kazuo ; Misono, Shinji ; Tezuka, Shu ; Fujishige, Satoru. / A new scaling algorithm for the maximum mean cut problem. In: Algorithmica. 1994 ; Vol. 11, No. 3. pp. 243-255.
@article{9c34e08e1c0e40ad8c2efca080a04ac8,
title = "A new scaling algorithm for the maximum mean cut problem",
abstract = "We present a new scaling algorithm for the maximum mean cut problem. The mean of a cut is defined by the cut capacity divided by the number of arcs crossing the cut. The algorithm uses an approximate binary search and solves the circulation feasibility problem with relaxed capacity bounds. The maximum mean cut problem has recently been studied as a dual analogue of the minimum mean cycle problem in the framework of the minimum cost flow problem by Ervolina and McCormick. A network N=(G, lower, upper) with lower and upper arc capacities is said to be δ-feasible if N has a feasible circulation when we relax the capacity bounds by δ; that is, we use (lower(a)- δ, upper(a)+δ) bounds instead of (lower(a), upper(a)) bounds for each arc a εA. During an approximate binary search we maintain two bounds, LB and UB, such that N is LB-infeasible and UB-feasible, and we reduce the interval size (LB, UB) by at least one-third at each iteration. For a graph with n vertices, m arcs, and integer capacities bounded by U, the running time of this algorithm is O(mn log(nU). This time bound is better than the time achieved by McCormick and Ervolina under the similarity condition (that is, U=O(no(1))). Our algorithm can be naturally used for the circulation feasibility problem, and thus provides a new scaling algorithm for the minimum cut problem.",
author = "Kazuo Iwano and Shinji Misono and Shu Tezuka and Satoru Fujishige",
year = "1994",
month = "3",
day = "1",
doi = "10.1007/BF01240735",
language = "English",
volume = "11",
pages = "243--255",
journal = "Algorithmica",
issn = "0178-4617",
publisher = "Springer New York",
number = "3",

}

TY - JOUR

T1 - A new scaling algorithm for the maximum mean cut problem

AU - Iwano, Kazuo

AU - Misono, Shinji

AU - Tezuka, Shu

AU - Fujishige, Satoru

PY - 1994/3/1

Y1 - 1994/3/1

N2 - We present a new scaling algorithm for the maximum mean cut problem. The mean of a cut is defined by the cut capacity divided by the number of arcs crossing the cut. The algorithm uses an approximate binary search and solves the circulation feasibility problem with relaxed capacity bounds. The maximum mean cut problem has recently been studied as a dual analogue of the minimum mean cycle problem in the framework of the minimum cost flow problem by Ervolina and McCormick. A network N=(G, lower, upper) with lower and upper arc capacities is said to be δ-feasible if N has a feasible circulation when we relax the capacity bounds by δ; that is, we use (lower(a)- δ, upper(a)+δ) bounds instead of (lower(a), upper(a)) bounds for each arc a εA. During an approximate binary search we maintain two bounds, LB and UB, such that N is LB-infeasible and UB-feasible, and we reduce the interval size (LB, UB) by at least one-third at each iteration. For a graph with n vertices, m arcs, and integer capacities bounded by U, the running time of this algorithm is O(mn log(nU). This time bound is better than the time achieved by McCormick and Ervolina under the similarity condition (that is, U=O(no(1))). Our algorithm can be naturally used for the circulation feasibility problem, and thus provides a new scaling algorithm for the minimum cut problem.

AB - We present a new scaling algorithm for the maximum mean cut problem. The mean of a cut is defined by the cut capacity divided by the number of arcs crossing the cut. The algorithm uses an approximate binary search and solves the circulation feasibility problem with relaxed capacity bounds. The maximum mean cut problem has recently been studied as a dual analogue of the minimum mean cycle problem in the framework of the minimum cost flow problem by Ervolina and McCormick. A network N=(G, lower, upper) with lower and upper arc capacities is said to be δ-feasible if N has a feasible circulation when we relax the capacity bounds by δ; that is, we use (lower(a)- δ, upper(a)+δ) bounds instead of (lower(a), upper(a)) bounds for each arc a εA. During an approximate binary search we maintain two bounds, LB and UB, such that N is LB-infeasible and UB-feasible, and we reduce the interval size (LB, UB) by at least one-third at each iteration. For a graph with n vertices, m arcs, and integer capacities bounded by U, the running time of this algorithm is O(mn log(nU). This time bound is better than the time achieved by McCormick and Ervolina under the similarity condition (that is, U=O(no(1))). Our algorithm can be naturally used for the circulation feasibility problem, and thus provides a new scaling algorithm for the minimum cut problem.

UR - http://www.scopus.com/inward/record.url?scp=0028401018&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0028401018&partnerID=8YFLogxK

U2 - 10.1007/BF01240735

DO - 10.1007/BF01240735

M3 - Article

VL - 11

SP - 243

EP - 255

JO - Algorithmica

JF - Algorithmica

SN - 0178-4617

IS - 3

ER -