The Valve Location Problem in Simple Network Topologies

Authors:
Hans L. Bodlaender;Albert Hendriks;Alexander Grigoriev;Nadejda V. Grigorieva
Affiliations:
Institute of Information and Computing Sciences, Utrecht University, 3508 TB Utrecht, The Netherlands;Institute of Information and Computing Sciences, Utrecht University, 3508 TB Utrecht, The Netherlands;Department of Quantitative Economics, Maastricht University, 6200 MD Maastricht, The Netherlands;Institute of Power Resources Transport (IPTER), Ufa 450055, Russia
Venue:
INFORMS Journal on Computing
Year:
2010

Citing 8
Cited 1

A separator theorem for graphs with an excluded minor and its applications

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

SIAM Journal on Computing
Measuring the vulnerability for classes of intersection graphs

Discrete Applied Mathematics
A partial k-arboretum of graphs with bounded treewidth

Theoretical Computer Science
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Finding small balanced separators

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
The valve location problem: Minimizing environmental damage of a spill in long oil pipelines

Computers and Industrial Engineering
Treewidth: characterizations, applications, and computations

WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science

How to cut a graph into many pieces

TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

To control possible spills in liquid or gas transporting pipe systems, the systems are usually equipped with shutoff valves. In case of an accidental leak, these valves separate the system into a number of pieces, limiting the spill effect. In this paper, we consider the problem, for a given edge-weighted network representing a pipe system and for a given number of valves, of placing the valves in the network in such a way that the maximum possible spill, i.e., the maximum total weight of a piece, is minimized. We show that the problem is NP-hard even if restricted to any of the following settings: (i) series-parallel graphs, and hence graphs of treewidth two; and (ii) all edge weights equal one. If the network is a simple path, a cycle, or a tree, the problem can be solved in polynomial time. We also give a pseudopolynomial-time algorithm and a fully polynomial-time approximation scheme for networks of bounded treewidth.