On the Complexity of Instationary Gas Flows
classification
🧮 math.OC
cs.DM
keywords
instationaryflowscomplexitystationaryalreadyb-flowscasesconsisting
read the original abstract
We study a simplistic model of instationary gas flows consisting of a sequence of k stationary gas flows. We present efficiently solvable cases and NP-hardness results, establishing complexity gaps between stationary and instationary gas flows (already for k=2) as well as between instationary gas s-t-flows and instationary gas b-flows.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.