Source location problem with flow requirements in directed networks

Optimization Methods and Software

Volumn 18, Issue 4 II, 2003, Pages 427-435

  Ito, Hiro ^a   Makino, Kazuhisa ^b   Arata, Kouji ^c   Honami, Shoji ^c   Itatsu, Yuichiro ^c   Fujishige, Satoru ^a  

^a KYOTO UNIVERSITY   (Japan)

^b OSAKA UNIVERSITY   (Japan)

^c NONE

Author keywords

Arc connectivity; Deficient set; Graph algorithm; Location problem; Network flow; Tree hypergraph

Indexed keywords

ALGORITHMS; GRAPH THEORY; POLYNOMIALS; SET THEORY;

DIRECTED NETWORKS;

PROBLEM SOLVING;

EID: 0141867590     PISSN: 10556788     EISSN: None     Source Type: Journal    
DOI: 10.1080/1055-6780309510593     Document Type: Article

References (18)

1. K. Arata, S. Iwata, K. Makino and S. Fujishige (2002). Locating sources to meet flow demands in undirected networks. Journal of Algorithms, 42, 54-68.
2. A. Brandstädt, V.B. Le and J.P. Spinrad (1999). Graph classes: a survey. SIAM Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia.
3. U. Feige (1996). A threshold of ln n for approximating set cover. In: Proc. ACM Symp. on Theory of Computing, pp. 314-318.
4. M.R. Garey and D.S. Johnson (1979). Computers and Intractability: A Guide to the Theory NP-Completeness. Freeman, New York.
5. F. Gavril (1972). Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of chordal graph. SIAM J. Comput., 1, 180-187.
6. M.C. Golumbic (1980). Algorithmic Graph Theory and Perfect Graphs. Academic Press. New York.
7. H. Ito and M. Yokoyama (1998). Edge connectivity between nodes and node-subsets. Networks, 31, 157-164.
8. H. Ito, H. Uehara and M. Yokoyama (2000). A faster and flexible algorithm for a location problem on undirected flow networks. IEICE Trans., E83-A, 704-712.
9. H. Ito, M. Ito, Y. Itatsu, K. Nakai, H. Uehara and M. Yokoyama (2002). Source location problems considering vertex-connectivity and edge-connectivity simultaneously. Networks, 40, 63-70.
10. M. Labbe, D. Peelers and J.-F. Thisse (1995). Location on networks. In: M.O. Ball et al. (Eds.), Handbooks in OR & MS, Vol. 8, pp. 551-624. North-Holland, Elsevier.
11. C. Lund and M. Yannakakis (1993). On the hardness of approximating minimization problems. In: Proc. 25th ACM Symposium on the Theory of Computing, pp. 286-293.
12. T.A. Mckee and F.R. McMorris (1999). Topics in intersection graph theory. SIAM Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia.
13. P.B. Mirchandani and R.L. Francis (Eds.) (1990). Discrete Location Theory. John Wiley Sons, Inc.
14. H. Nagamochi, T. Ishii and H. Ito (2001). Minimum cost source location problem with vertex-connectivity requirements in digraphs. Information Processing Letters, 80, 287-294.
15. H. Tamura, M. Sengoku, S. Shinoda and T. Abe (1990). Location problems on undirected flow networks. IEICE Trans., E73, 1989-1993.
16. H. Tamura, M. Sengoku, S. Shinoda and T. Abe (1992). Some covering problems in location theory on flow networks. IEICE Trans., E75-A, 678-683.
17. H. Tamura, H. Sugawara, M. Sengoku and S. Shinoda (1997). On a generalization of a covering problem called single cover on undirected flow networks. IEICE Trans., E80-A, 544-550.
18. H. Tamura, H. Sugawara, M. Sengoku and S. Shinoda (1998). Plural cover problem on undirected flow networks. IEICE Trans., J81-A, 863-869 (in Japanese).