Before revision:  To obtain our results , we give an O(n) space deterministic semi-streaming algorithm for approximating the value of linear programs (in the form of box-simplex games), based on low-space implementations of She17 , JST19 . We further give a general sampling procedure for explicitly forming a fractional solution in low space, yielding improved semi-streaming guarantees for optimal transport and, in some regimes, maximum weighted matching.
After revision:  To obtain our results , we give an O(n) space deterministic semi-streaming algorithm for approximating the value of linear programs (in the form of box-simplex games), based on low-space implementations of adaptations of more general continuous optimization tools. Further, we leverage these techniques to obtain improvements for streaming variants of approximate linear programming, optimal transport , JST19 . We further give a general sampling procedure for explicitly forming a fractional solution in low space, yielding improved semi-streaming guarantees for optimal transport and, in some regimes, maximum weighted matching.