The complexity of flow expansion and electrical flow expansion

DOI10.1007/978-3-030-67731-2_32zbMath1490.90084OpenAlexW3121519156MaRDI QIDQ831846

Dorothea Wagner, Matthias Wolf

Publication date: 24 March 2022

Full work available at URL: https://publikationen.bibliothek.kit.edu/1000134698

zbMATH Keywords

minimum cost flowexpansion planningflow networkselectrical flows

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms (68W40) Deterministic network models in operations research (90B10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Applications of graph theory to circuits and networks (94C15) Flows in graphs (05C21)

Cites Work

• The Steiner tree problem on graphs: inapproximability results
• On the budget-restricted max flow problem
• A Cycle-Based Formulation and Valid Inequalities for DC Power Transmission Problems with Switching
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The complexity of flow expansion and electrical flow expansion