DocumentCode :
3503054
Title :
On a minimax realization problem on flow networks
Author :
Tamura, Hiroshi ; Sengoku, Masakazu ; Shinoda, Shoji ; Abe, Takeo
Author_Institution :
Dept. of Inf. & Electron. Eng., Niigata Inst. of Technol., Kashiwazaki, Japan
Volume :
2
fYear :
1999
fDate :
36495
Firstpage :
801
Abstract :
We consider a realization problem of an undirected flow network N from a matrix M. We assume that M is not always a terminal capacity matrix. In our previous study, we considered a problem to minimize the differences between capacities between vertex pairs in N, and elements of M. We called this problem “minimax realization problem.” In this paper, we propose another minimax realization problem and propose an algorithm to minimize the differences
Keywords :
graph theory; matrix algebra; minimax techniques; flow networks; graph theory; minimax realization problem; network theory; terminal capacity matrix; undirected flow network; Electronic mail; Minimax techniques; Network theory (graphs); Sufficient conditions; Symmetric matrices; Tree graphs;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
TENCON 99. Proceedings of the IEEE Region 10 Conference
Conference_Location :
Cheju Island
Print_ISBN :
0-7803-5739-6
Type :
conf
DOI :
10.1109/TENCON.1999.818539
Filename :
818539
Link To Document :
بازگشت