Locating sources to meet flow demands in undirected networks

Journal of Algorithms

Volumn 42, Issue 1, 2002, Pages 54-68

  Arata, Kouji ^a   Iwata, Satoru ^b   Makino, Kazuhisa ^c   Fujishige, Satoru ^c  

^a PANASONIC CORPORATION   (Japan)

^b UNIVERSITY OF TOKYO   (Japan)

^c OSAKA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING; THEOREM PROVING;

FLOW DEMANDS; UNDIRECTED NETWORKS;

SET THEORY;

EID: 0036462118     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.2001.1203     Document Type: Article

References (14)

1. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, "Network Flows," Prentice Hall, Englewood Cliffs, NJ., 1993.
2. K. Arata, S. Iwata, K. Makino, and S. Fujishige, Locating sources to meet flow demands in undirected networks, in SWAT2000 (M. M. Halldorsson, Ed.), Springer Lecture Notes in Computer Science, Vol. 1851, pp. 300-313, Springer-Verlag, Berlin/New York, 2000.
3. 2) time, J. Algorithms, 37 (2000), 2-36.
4. M. R. Garey and D. S. Johnson, "Computers and Intractability," Freeman, New York, 1979.
5. A. V. Goldberg and S. Rao, Beyond the flow decomposition barrier, J. ACM 45 (1998), 783-797.
6. A. V. Goldberg and S. Rao, Flows in undirected unit capacity networks, SIAM J. Discrete Math. 12 (1999), 1-5.
7. H. Ito, H. Uehara, and M. Yokoyama, A faster and flexible algorithm for a location problem on undirected flow networks, IEICE Trans. Fund. E83-A (2000), 704-712.
8. H. Nagamochi and T. Ibaraki, Computing edge-connectivity of multigraphs and capacitated graphs, SIAM J. Discrete Math. 5 (1992), 54-66.
9. H. Nagamochi and T. Ibaraki, Deterministic Õ(nm) time edge-splitting in undirected graphs, J. Combin. Optim. 1 (1997), 5-46.
10. H. Nagamochi and T. Ibaraki, A note on minimizing submodular functions, Inform. Process. Lett. 67 (1998), 169-178.
11. M. Stoer and F. Wagner, A simple min cut algorithm, J. ACM 44 (1997) 585-591.
12. H. Tamura, M. Sengoku, S. Shinoda, and T. Abe, Some covering problems in location theory on flow networks, IEICE Trans. Fund. E75-A (1992), 678-683.
13. H. Tamura, H. Sugawara, M. Sengoku, and S. Shinoda, Plural cover problem on undirected flow networks (in Japanese), IEICE Trans. Fund. J81-A (1998), 863-869.
14. T. Watanabe and A. Nakamura, Edge connectivity augmentation problems, J. Comput. System Sci. 53 (1987), 96-144.