A faster and flexible algorithm for a location problem on undirected flow networks

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E83-A, Issue 4, 2000, Pages 704-711

  Ito, Hiro ^a   Uehara, Hideyuki ^a   Yokoyama, Mitsuo ^a  

^a TOYOHASHI UNIVERSITY OF TECHNOLOGY   (Japan)

Author keywords

Algorithm; Graph; Location problem; Network flow; Node subset; Polynomial time

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; POLYNOMIALS;

UNDIRECTED FLOW NETWORKS;

GRAPH THEORY;

EID: 0033687324     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (13)

1. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network Flows, Prentice-Hall, 1993.
2. N, Alon, "Generating pseudo-random permutations and maximum flow algorithms," Inf. Process. Lett., vol.35, pp.201-204, 1990.
3. A.V. Goldberg and R.E. Tarjan, "A new approach to the maximum flow problem," J. ACM, vol.35, pp.921-940, 1988.
4. A.V. Goldberg and S. Rao, "Beyond the flow decomposition barrier," Proc. 38th Annual Symp. on Foundations of Computer Science: FOCS'97, pp.2-11, 1997.
5. A.V. Goldberg, "Recent developments in maximum flow algorithms," Proc. SWAT'98, LNCS 1432, pp.1-10, 1998.
6. R.E. Gomory and T.C. Hu, "Multi-terminal network flows," SIAM J. APPL. Math., vol.9, pp.551-570, 1961.
7. H. Ito and M. Yokoyama, "Edge connectivity between nodes and node-subsets," Networks, vol.31, no.3, pp.157-164, 1998.
8. H. Ito, M. Ito, H. Uehara, and M. Yokoyama, "Finding the minimum node-subset for being k-node-connected between each node and the node-subset for k ≤ 3," IEICE Technical Report, COMP 97-110, 1998.
9. S. Honami, H. Ito, H. Uehara, and M. Yokoyama, "An algorithm for finding a node-subset having high connectivity from other nodes," IPSJ SIG Notes, AL-66, vol.99, no.8, pp.9-16, 1999.
10. V. King, S. Rao, and R.E. Tarjan, "A faster deterministic maximum flow algorithm," J. Algorithms, vol.17, pp.447-474, 1994.
11. M. Labbe, D. Peeters, and J.F. Thisse, "Location on networks," in Handbooks in OR & MS, eds. M.O. Ball, T.L. Magnanti, C.L. Monma, and G.L. Nemhauser, vol.8, North-Holland, pp.551-624, 1995.
12. H. Tamura, M. Sengoku, S. Shinoda, and T. Abe, "Location problems on undirected flow networks," IEICE Trans., vol.E73, no.12, pp.1989-1993, Dec. 1990.
13. H. Tamura, H. Sugawara, M. Sengoku, and S. Shinoda, "Plural cover problem on undirected flow networks," IEICE Trans., vol.J81-A, no.5, pp.863-869, May 1998.