Algorithmic results for potential‐based flows: Easy and hard cases. Issue 3 (24th December 2018)

• Record Type: Journal Article
• Authors: Gross, Martin; Pfetsch, Marc E.; Schewe, Lars; Schmidt, Martin; Skutella, Martin
• Is Part Of: Networks. Volume 73:Issue 3(2019)
• Page Start: 306
• Page End: 324
• Publication Date: 2018-12-24
• Subjects: maximum flow problem -- network reduction -- NP‐hardness -- potential‐based flows -- potential networks -- series‐parallel graphs; Network analysis (Planning) -- Periodicals; 658.4032
• DOI: 10.1002/net.21865
• Languages: English
• ISSNs: 0028-3045

Abstract

Abstract: Potential‐based flows are an extension of classical network flows in which the flow on an arc is determined by the difference of the potentials of its incident nodes. Such flows are unique and arise, for example, in energy networks. Two important algorithmic problems are to determine whether there exists a feasible flow and to maximize the flow between two designated nodes. We show that these problems can be solved for the single source and sink case by reducing the network to a single arc. However, if we additionally consider switches that allow to force the flow to 0 and decouple the potentials, these problems are NP‐hard. Nevertheless, for particular series‐parallel networks, one can use algorithms for the subset sum problem. Moreover, applying network presolving based on generalized series‐parallel structures allows to significantly reduce the size of realistic energy networks.