Journal of the ACM Bibliography

Selected papers that cite this one

• Ravindra K. Ahuja, James B. Orlin, Clifford Stein, and Robert E. Tarjan. Improved algorithms for bipartite network flow. SIAM Journal on Computing, 23(5):906-933, October 1994.

• Ernst Althaus and Kurt Mehlhorn. Maximum network flow with floating point arithmetic. Information Processing Letters, 66(3):109-113, 15 May 1998.

• András Benczúr. Augmenting undirected connectivity in RNC and in randomized \tilde{O}(n^3) time. In Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing, pages 658-667, Montréal, Québec, Canada, 23-25 May 1994.

• András A. Benczúr and David R. Karger. Approximating s-t minimum cuts in \tilde{O}(n^2) time. In Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, pages 47-55, Philadelphia, Pennsylvania, 22-24 May 1996.

• Chandra S. Chekuri, Andrew V. Goldberg, David R. Karger, Matthew S. Levine, and Cliff Stein. Experimental study of minimum cut algorithms. In Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 324-333, New Orleans, Louisiana, 5-7 January 1997.

• Loon-Been Chen and I-Chen Wu. On the time complexity of minimum and maximum global snapshort problems. Information Processing Letters, 67(3):151-156, 17 August 1998.

• Joseph Cheriyan and Torben Hagerup. A randomized maximum-flow algorithm. SIAM Journal on Computing, 24(2):203-226, April 1995.

• Joseph Cheriyan, Torben Hagerup, and Kurt Mehlhorn. An o(n^3)-time maximum-flow algorithm. SIAM Journal on Computing, 25(6):1144-1170, December 1996.

• B. V. Cherkassky and A. V. Goldberg. On implementing the push-relabel method for the maximum flow problem. Algorithmica, 19(4):390-410, December 1997.

• Edith Cohen. Approximate max-flow on small depth networks. SIAM Journal on Computing, 24(3):579-597, June 1995.

• E. Dahlhaus, D. S. Johnson, C. H. Papadimitriou, P. D. Seymour, and M. Yannakakis. The complexity of multiterminal cuts. SIAM Journal on Computing, 23(4):864-894, August 1994.

• L. Fleischer. Faster algorithms for the quickest transshipment problem with zero transit times. In Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 147-156, San Francisco, California, 25-27 January 1998.

• Greg N. Frederickson. A data structure for dynamically maintaining rooted trees. Journal of Algorithms, 24(1):37-65, July 1997.

• Harold N. Gabow. Algorithms for graphic polymatroids and parametric \bar{s}-sets. Journal of Algorithms, 26(1):48-86, January 1998.

• Harold N. Gabow. Centroids, representations, and submodular flows. Journal of Algorithms, 18(3):586-628, May 1995.

• Andrew V. Goldberg. An efficient implementation of a scaling minimum-cost flow algorithm. Journal of Algorithms, 22(1):1-29, January 1997.

• Andrew V. Goldberg and Satish Rao. Beyond the flow decomposition barrier. In 38th Annual Symposium on Foundations of Computer Science, pages 2-11, Miami Beach, Florida, 20-22 October 1997. IEEE.

• Monika R. Henzinger, Satish Rao, and Harold N. Gabow. Computing vertex connectivity: New bounds from old techniques. In 37th Annual Symposium on Foundations of Computer Science, pages 462-471, Burlington, Vermont, 14-16 October 1996. IEEE.

• Dorit S. Hochbaum. Approximating clique and biclique problems. Journal of Algorithms, 29(1):174-200, October 1998.

• Dorit S. Hochbaum and Joseph (Seffi) Naor. Simple and fast algorithms for linear and integer programs with two variables per inequality. SIAM Journal on Computing, 23(6):1179-1192, December 1994.

• Satoru Iwata, S. Thomas McCormick, and Maiko Shigeno. A faster algorithm for minimum cost submodular flows. In Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 167-174, San Francisco, California, 25-27 January 1998.

• David R. Karger and Clifford Stein. A new approach to the minimum cut problem. Journal of the ACM, 43(4):601-640, July 1996.

• Stavros G. Kolliopoulos and Clifford Stein. Improved approximation algorithms for unsplittable flow problems (extended abstract). In 38th Annual Symposium on Foundations of Computer Science, pages 426-435, Miami Beach, Florida, 20-22 October 1997. IEEE.

• Yishay Mansour and Boaz Patt-Shamir. Many-to-one packet routing on grids (extended abstract). In Proceedings of the Twenty-Seventh Annual ACM Symposium on the Theory of Computing, pages 258-267, Las Vegas, Nevada, 29 May-1 June 1995.

• S. Thomas McCormick. Fast algorithms for parametric scheduling come from extensions to parametric maximum flow. In Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, pages 319-328, Philadelphia, Pennsylvania, 22-24 May 1996.

• Ketan Mulmuley. Lower bounds for parallel linear programming and other problems. In Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing, pages 603-614, Montréal, Québec, Canada, 23-25 May 1994.

• Hiroshi Nagamochi and Toshihide Ibaraki. Deterministic \tilde{O}(nm) time edge-splitting in undirected graphs. In Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, pages 64-73, Philadelphia, Pennsylvania, 22-24 May 1996.

• Hiroshi Nagamochi and Toshihide Ibaraki. A note on minimizing submodular functions. Information Processing Letters, 67(5):239-244, 15 September 1998.

• Martin Skutella. Approximation algorithms for the discrete time-cost tradeoff problem. In Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 501-508, New Orleans, Louisiana, 5-7 January 1997.

• Mechthild Stoer and Frank Wagner. A simple min-cut algorithm. Journal of the ACM, 44(4):585-591, July 1997.

• Xiaodong Wang and Vwani P. Roychowdhury. Optimal communication algorithms for heterogeneous computing over ATM networks. Journal of Parallel and Distributed Computing, 46(1):62-79, 1 October 1997.

• Karsten Weihe. Maximum (s, t)-flows in planar networks in O(|V| log |V|) time. Journal of Computer and System Sciences, 55(3):454-475, December 1997.

Shortcuts: