Clustering for Faster Network Simplex Pivots (1993) [3 citations — 1 self]
Download:
http://comptop.stanford.edu/references/ep.pdf
http://www.ics.uci.edu/~eppstein/pubs/Epp-TR-93-19
DBLP
CACHED:
http://comptop.stanford.edu/references/ep.pdf
http://www.ics.uci.edu/~eppstein/pubs/Epp-TR-93-19
DBLP
CACHED:
by
David Eppstein
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@MISC{Eppstein93clusteringfor,
author = {David Eppstein},
title = {Clustering for Faster Network Simplex Pivots},
year = {1993}
}
author = {David Eppstein},
title = {Clustering for Faster Network Simplex Pivots},
year = {1993}
}
Bookmarks
OpenURL
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)toO( # 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.
