Transversals of subtree hypergraphs and the source location problem in digraphs

Networks

Volumn 51, Issue 2, 2008, Pages 113-119

  Van Heuvel, Jan Den ^a   Johnson, Matthew ^a,b  

^a LONDON SCHOOL OF ECONOMICS   (United Kingdom)

^b DURHAM UNIVERSITY   (United Kingdom)

Author keywords

Hypertree; Polynomial algorithm; Source location; Subtree hypergraph; Transversal

Indexed keywords

HYPERTREE; POLYNOMIAL ALGORITHM; SOURCE LOCATION; SUBTREE HYPERGRAPH; TRANSVERSAL;

GRAPH THEORY;

EID: 51349158476     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.20206     Document Type: Article

References (14)

1. K. Arata, S. Iwata, K. Makino, and S. Fujishige, Locating sources to meet flow demands in undirected networks, J Algorithms 42 (2002), 54-68.
2. M. Bárász, J. Becker, and A. Frank, An algorithm for source location in directed graphs, Oper Res Lett 33 (2005), 221-230.
3. R. Diestel, Graph Theory, Springer-Verlag, New York, 1997.
4. P. Duchet, "Hypergraphs", Handbooks of combinatorics, R. Graham, M. Grotschel, and L. Lovász (Editors), Elsevier Science B.V., 1995, pp. 381-432.
5. J. Hao and J.B. Orlin, A faster algorithm for finding the minimum cut in a graph, J Algorithms 17 (1994), 424-446.
6. H. Ito, M. Ito, Y. Itatsu, K. Nakai, H. Uehara, and M. Yokoyama, Source Location Problems considering vertexconnectivity and edge-connectivity simultaneously, Networks 40 (2002), 63-70.
7. H. Ito, M. Ito, Y. Itatsu, H. Uehara, and M. Yokohama, Location problems based on node-connectivity and edge-connectivity between nodes and node-subsets, Lecture Notes Comput Sci 1969 (2000), 338-349.
8. H. Ito, K. Makino, K. Arata, S. Honami, Y Itatsu, and S. Fujishige, Source location problem with flow requirements in directed networks, Optimization Methods Software 18 (2003), 427-435.
9. H. Ito, H. Uehara, and M. Yokoyama, A faster and flexible algorithm for a location problem on undirected flow networks, IEICE Trans E83-A (2000), 704-712.
10. H. Ito and M. Yokoyama, Edge-connectivity between nodes and node-subsets, Networks 31 (1998), 157-164.
11. M. Labbe, D. Peeters, and J.-F. Thisse, "Location on networks", Handbooks in Operations research and management science, 8: Network routing, M.O. Ball, T.L. Magnanti, C.L. Monma, and G.L. Nemhauser (Editors), Elsevier, North-Holland, 1995, pp. 551-624.
12. H. Nagamochi, T. Ishii, and H. Ito, Minimum cost source location problem with vertex-connectivity requirements in digraphs, Info Process Lett 80 (2001), 287-294.
13. H. Tamura, M. Sengoku, S. Shinoda, and T. Abe, Location problems on undirected flow networks, IEICE Trans E73 (1990), 1989-1993.
14. Open Problems page of the Egerváry Research Group on Combinatorial Optimization, Available at http://www.cs.elte.hu/egres/, http://www.cs.elte.hu/ egres/design/mf_problems.html.