| Article ID: | iaor1995297 |
| Country: | Netherlands |
| Volume: | 14 |
| Issue: | 3 |
| Start Page Number: | 129 |
| End Page Number: | 132 |
| Publication Date: | Oct 1993 |
| Journal: | Operations Research Letters |
| Authors: | McCormick Thomas S. |
Iwano, Misono, Tezuka, and Fujishige have given an approximate binary search algorithm for computing max mean cuts. This paper gives a short proof of the correctness of their algorithm. It also shows how their algorithm can be dualized to an approximate binary search algorithm for computing min mean cycles that is as fast as but simpler than Orlin and Ahuja’s algorithm.