 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. Finally, we improve the space complexity of our maximum cardinality matching method using an implicit implementation of the random walk rounding of%DIFDELCMD < [%%% GKK10 via custom turnstile samplers .
<meaning-changed>  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. Finally, we improve the space complexity of our maximum cardinality matching method using an implicit implementation of the random walk rounding of%DIFDELCMD < [%%% GKK10 via custom turnstile samplers .
 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 %DIFDELCMD < [%%% GKK10 via custom turnstile samplers .