Transportation Problems and Simplicial Polytopes That Are Not Weakly Vertex-Decomposable

Provan and Billera defined the notion of weak k-decomposability for pure simplicial complexes in the hopes of bounding the diameter of convex polytopes. They showed the diameter of a weakly k-decomposable simplicial complex ã is bounded above by a polynomial function of the number of k-faces in ã and its dimension. For weakly 0-decomposable complexes, this… CONTINUE READING