The Valve Location Problem in Simple Network Topologies

DOI10.1007/978-3-540-92248-3_6zbMath1202.90260WikidataQ59567749 ScholiaQ59567749MaRDI QIDQ5302043

Hans L. Bodlaender, Alexander Grigoriev, Albert Hendriks, Nadejda V. Grigorieva

Publication date: 20 January 2009

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-92248-3_6

zbMATH Keywords

computational complexity; dynamic programming; binary search; bounded treewidth; valve location problem

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

68Q25: Analysis of algorithms and problem complexity

90C59: Approximation methods and heuristics in mathematical programming

90C39: Dynamic programming

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)