On a generalization of a covering problem called single cover on undirected flow networks

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E80-A, Issue 3, 1997, Pages 544-549

  Tamura, Hiroshi ^a  

^a NIIGATA INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

Covering problem; Flow network; Graphs and networks; Location theory

Indexed keywords

ALGORITHMS; COMPUTER NETWORKS; CONSTRAINT THEORY; GRAPH THEORY; POLYNOMIALS; PROBLEM SOLVING;

LOCATION THEORY; SINGLE COVER PROBLEM; UNDIRECTED FLOW NETWORK;

COMPUTATION THEORY;

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

References (10)

1. G. Y. Handler and P.B. Mirchandani, "Location on networks: Theory and Algorithms," MIT Press, 1979.
2. H. Tamura, M. Sengoku, S. Shinoda, and T. Abe, "Location problems on undirected flow networks," IEICE Trans., vol. E73, no. 12, pp. 1989-1993, 1990.
3. H. Tamura, M. Sengoku, S. Shinoda, and T. Abe, "Some covering problems in location theory on flow networks," IEICE Trans., vol. E75-A, no. 6, pp. 678-684, 1992.
4. K. Watanabe, H. Tamura, and M. Sengoku, "Problems of where to locate />-sinks in a flow network," IEICE Trans., vol. J78-A, no. 8, pp. 938-946, 1995.
5. M. Bezad, G. Chartrand, and L. L. Foster, "Graphs and Digraphs," Prindle, Weber & Schmidt, I979.
6. C. Berge, "Graphs," North-Holland, 1985.
7. L. R. Ford and D. R. Fulkerson, "Flows in Networks," Princeton University Press, Princeton, 1962.
8. R. E. Gomory and T. C. Hu, "Multi-terminal network flows," J. Soc. Indust. Appl. Math., vol. 9, no. 4, pp. 551570, 1961.
9. A. V. Goldberg and R. E. Tarjan,"A new approach to the maximum flow problem," Proc. 18th Annual ACM Symposium on Theory of Computing, pp. 136-146, 1986.
10. T. Moriizumi, S. Tsukiyama, S. Shinoda, M. Sengoku, and I. Shirakawa, "An optimal cardinality-constrained territory map on a network" IEICE Trans., vol.J71-A, no. 10, pp. 1917-1929, 1988.