The valve location problem in simple network topologies

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5344 LNCS, Issue , 2008, Pages 55-65

  Bodlaender, Hans L ^a   Grigoriev, Alexander ^b   Grigorieva, Nadejda V ^c   Hendriks, Albert ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

^b MAASTRICHT UNIVERSITY   (Netherlands)

^c Institute of Power Resources Transport (IPTER)   (Russian Federation)

Author keywords

Binary search; Bounded treewidth; Computational complexity; Dynamic programming; Valve location problem

Indexed keywords

ACCIDENTS; APPROXIMATION ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; COMPUTERS; DYNAMIC PROGRAMMING; ELECTRIC NETWORK TOPOLOGY; HAZARDOUS MATERIALS SPILLS; PIPE; POLYNOMIALS; SYSTEMS ENGINEERING; TECHNICAL PRESENTATIONS; VALVES (MECHANICAL);

ACCIDENTAL LEAKS; BINARY SEARCH; BOUNDED TREEWIDTH; EDGE WEIGHTS; NP-HARD; PIPE SYSTEMS; POLYNOMIAL TIMES; SERIES-PARALLEL GRAPHS; SHUTOFF VALVES; SIMPLE NETWORKS; TOTAL WEIGHTS; TRANSPORTING PIPES; TREE WIDTHS; VALVE LOCATION PROBLEM; WEIGHTED NETWORKS;

POLYNOMIAL APPROXIMATION;

EID: 58349103623     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-92248-3_6     Document Type: Conference Paper

References (15)

1. Alon, N., Seymour, P., Thomas, R.: A separator theorem for graphs with an excluded minor and its applications. In: Proc. of the 22nd Symposium on Theory of Computing, STOC 1980, pp. 293-299. ACM Press, New York (1980)
2. Barefoot, C.A., Entringer, R., Swart, H.C.: Vulnerability in graphs: a comparative survey. J. Comb. Math. Comb. Comput. 1, 12-22 (1987)
3. Barefoot, C.A., Entringer, R., Swart, H.C.: Integrity of trees and the diameter of a graphs. Congressus Numerantium 58, 103-114 (1987)
4. Bodlaender, H.L.: A linear time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25, 1305-1317 (1996)
5. Bodlaender, H.L.: A partial k-arboretum of graphs with bounded treewidth. Theor. Comp. Sc. 209, 1-45 (1998)
6. Bodlaender, H.L.: Treewidth: Characterizations, applications, and computations. In: Fomin, F.V. (ed.) WG 2006. LNCS, vol. 4271, pp. 1-14. Springer, Heidelberg (2006)
7. Bouwman, S.: A survey of OR models and techniques for electrical grid companies. In: Proceedings of the 33rd Conference on the Mathematics of Operations Research, Lunteren 2008, Landelijk Netwerk Mathematische Besliskunde, The Netherlands (2008)
8. Feige, U., Mahdian, M.: Finding small balanced separators. In: Proceedings of the 37th Annual Symposium on Theory of Computing, STOC 2006, pp. 375-384. ACM Press, New York (2006)
9. Garey, M.R., Johnson, D.S.: Computers and intractability: A guide to the theory of NP-completeness. W. H. Freeman, San Francisco (1979)
10. Grigorieva, N.V., Grigoriev, A.: Optimal valve location in long oil pipelines. Research Memorandum RM/07/007, Maastricht Research School of Economics of Technology and Organizations (METEOR), Maastricht University, Maastricht, The Netherlands (2007), http://ideas.repec.org/p/dgr/umamet/2007007. html
11. Hicks, I.V., Koster, A.M.C.A., Kolotoglu, E.: Branch and tree decomposition techniques for discrete optimization. In: Smith, J.C. (ed.) TutORials 2005, INFORMS Tutorials in Operations Research Series, ch. 1, pp. 1-29. INFORMS Annual Meeting (2005)
12. Kloks, T.: Treewidth. Computations and Approximations. LNCS, vol. 842. Springer, Berlin (1994)
13. Kratsch, D., Kloks, T., Müller, H.: Measuring the vulnerability for classes of intersection graphs. Discrete Applied Mathematics 77(3), 259-270 (1997)
14. Marx, D.: Parameterized Graph Separation Problems. In: Downey, R.G., Fellows, M.R., Dehne, F. (eds.) IWPEC 2004. LNCS, vol. 3162, pp. 71-82. Springer, Heidelberg (2004)
15. Ozger, S., Mays, L.W.: Optimal location of isolation valves: A reliability approach. In: Water Supply Systems Security, Digital Engineering Library. McGraw-Hill, New York (2004), http://dx.doi.org/10.1036/0071455663.CH13