On a realization problem from non-terminal capacity matrices on undirected flow networks

被引:0
|
作者
Tamara, H [1 ]
Sengoku, M
Shinoda, S
Abe, T
机构
[1] Niigata Inst Technol, Dept Informat & Elect Engn, Kashiwazaki, Chiba 9451195, Japan
[2] Niigata Univ, Fac Engn, Niigata 9502181, Japan
[3] Chuo Univ, Fac Sci & Engn, Tokyo 1128551, Japan
关键词
graph theory; flow network; terminal capacity matrix; realization problem; NP-complete;
D O I
10.1002/ecjc.1054
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The problem of realizing a given matrix on an undirected flow network has been studied and various results have been obtained. Most of these results consist of necessary and sufficient conditions for methods of realization in which the maximum good flow between the two points and the matrix components coincide. However, there are cases in which coincidence is not required as long as they are close to each other. In this paper, we consider the realization under certain conditions when values not necessarily realizable as maximum good flows of the flow network are given between two points. First, the upper and lower bounds of the maximum good flow are given. The problem of realization between these two extremes is studied and the necessary and sufficient condition is given. Next, by means of this result, we consider the problem of minimizing the difference between the given value and the maximum good flow in the undirected flow network. A realization method is studied. (C) 2001 Scripta Technica, Electron Comm Jpn Pt 3, 84(12): 28-39, 2001.
引用
收藏
页码:28 / 39
页数:12
相关论文
共 44 条
  • [1] Realization of flow networks from non-terminal capacity matrices
    Tamura, Hiroshi
    Sengoku, Masakazu
    Shinoda, Shoji
    Abe, Takeo
    IEEE Asia-Pacific Conference on Circuits and Systems - Proceedings, 1998, : 467 - 470
  • [2] Realization of flow networks from non-terminal capacity matrices
    Tamura, H
    Sengoku, M
    Shinoda, S
    Abe, T
    APCCAS '98 - IEEE ASIA-PACIFIC CONFERENCE ON CIRCUITS AND SYSTEMS: MICROELECTRONICS AND INTEGRATING SYSTEMS, 1998, : 467 - 470
  • [3] The minimum spanning tree problem with non-terminal set
    Zhang, Tongquan
    Yin, Ying
    INFORMATION PROCESSING LETTERS, 2012, 112 (17-18) : 688 - 690
  • [4] Multiple cover problem on undirected flow networks
    Tamura, Hiroshi
    Sugawara, Hidehito
    Sengoku, Masakazu
    Shinoda, Shoji
    Electronics and Communications in Japan, Part III: Fundamental Electronic Science (English translation of Denshi Tsushin Gakkai Ronbunshi), 2001, 84 (01): : 67 - 74
  • [5] On a generalization of a covering problem on undirected flow networks
    Tamura, H
    Sugawara, H
    Sengoku, M
    Shinoda, S
    APCCAS '96 - IEEE ASIA PACIFIC CONFERENCE ON CIRCUITS AND SYSTEMS '96, 1996, : 460 - 463
  • [6] Multiple cover problem on undirected flow networks
    Tamura, H
    Sugawara, H
    Sengoku, M
    Shinoda, S
    ELECTRONICS AND COMMUNICATIONS IN JAPAN PART III-FUNDAMENTAL ELECTRONIC SCIENCE, 2001, 84 (01): : 67 - 74
  • [7] A faster and flexible algorithm for a location problem on undirected flow networks
    Ito, H
    Uehara, H
    Yokoyama, M
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2000, E83A (04): : 704 - 712
  • [8] Faster and flexible algorithm for a location problem on undirected flow networks
    Ito, Hiro
    Uehara, Hideyuki
    Yokoyama, Mitsuo
    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2000, E83-A (04) : 704 - 712
  • [9] On a generalized minimax realization problem on flow networks
    Tamura, H
    Sengoku, M
    Shinoda, S
    Abe, T
    2000 IEEE ASIA-PACIFIC CONFERENCE ON CIRCUITS AND SYSTEMS: ELECTRONIC COMMUNICATION SYSTEMS, 2000, : 634 - 637
  • [10] On a generalization of a covering problem called single cover on undirected flow networks
    Tamura, H
    Sugawara, H
    Sengoku, M
    Shinoda, S
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 1997, E80A (03) : 544 - 550