Clustering for faster network simplex pivots

Author(s): Eppstein, David | Abstract: We show how to use tree clustering techniques to improve the time bounds for optimal pivot selection in the primal network simplex algorithm for minimum cost flow, and for pivot execution in the dual network simplex algorithm for the same problem, from O(m) to O([square root of]m) per pivot. Our techniques can also speed up network simplex algorithms for generalized flow, shortest paths with negative edges, maximum flow, the assignment problem, and the transshipment problem.

[1]  Bernard Chazelle,et al.  An optimal algorithm for intersecting three-dimensional convex polyhedra , 1989, 30th Annual Symposium on Foundations of Computer Science.

[2]  David Eppstein,et al.  Offline Algorithms for Dynamic Minimum Spanning Tree Problems , 1991, J. Algorithms.

[3]  Robert E. Tarjan,et al.  Making data structures persistent , 1986, STOC '86.

[4]  David G. Kirkpatrick,et al.  Fast Detection of Polyhedral Intersection , 1983, Theor. Comput. Sci..

[5]  Greg N. Frederickson,et al.  Data structures for on-line updating of minimum spanning trees , 1983, STOC.

[6]  Robert E. Tarjan,et al.  A data structure for dynamic trees , 1981, STOC '81.

[7]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[8]  Greg N. Frederickson,et al.  Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications , 1985, SIAM J. Comput..

[9]  Pravin M. Vaidya,et al.  Speeding-up linear programming using fast matrix multiplication , 1989, 30th Annual Symposium on Foundations of Computer Science.

[10]  Andrew V. Goldberg,et al.  Use of dynamic trees in a network simplex algorithm for the maximum flow problem , 1991, Math. Program..

[11]  John M. Mulvey,et al.  Pivot Strategies for Primal-Simplex Network Codes , 1978, JACM.

[12]  Éva Tardos,et al.  Improved dual network simplex , 1990, SODA '90.

[13]  Greg N. Frederickson,et al.  Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.