On the Complexity of Instationary Gas Flows
Martin Gro{\ss}, Marc E. Pfetsch, Martin Skutella
TL;DR
This paper investigates the computational complexity of a simplified model of time-varying gas flows, revealing both efficiently solvable cases and NP-hardness results, and highlighting complexity differences from stationary flow models.
Contribution
It introduces a simplified model of instationary gas flows and establishes complexity gaps compared to stationary flows, including NP-hardness for certain cases.
Findings
Efficiently solvable cases identified
NP-hardness results established for specific scenarios
Complexity gaps between stationary and instationary flows demonstrated
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimization and Search Problems