{"title":"流网络的极大极小实现问题","authors":"H. Tamura, M. Sengoku, S. Shinoda, T. Abe","doi":"10.1109/TENCON.1999.818539","DOIUrl":null,"url":null,"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.","PeriodicalId":121142,"journal":{"name":"Proceedings of IEEE. IEEE Region 10 Conference. TENCON 99. 'Multimedia Technology for Asia-Pacific Information Infrastructure' (Cat. No.99CH37030)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"On a minimax realization problem on flow networks\",\"authors\":\"H. Tamura, M. Sengoku, S. Shinoda, T. Abe\",\"doi\":\"10.1109/TENCON.1999.818539\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":121142,\"journal\":{\"name\":\"Proceedings of IEEE. IEEE Region 10 Conference. TENCON 99. 'Multimedia Technology for Asia-Pacific Information Infrastructure' (Cat. No.99CH37030)\",\"volume\":\"16 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-09-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of IEEE. IEEE Region 10 Conference. TENCON 99. 'Multimedia Technology for Asia-Pacific Information Infrastructure' (Cat. No.99CH37030)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TENCON.1999.818539\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of IEEE. IEEE Region 10 Conference. TENCON 99. 'Multimedia Technology for Asia-Pacific Information Infrastructure' (Cat. No.99CH37030)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TENCON.1999.818539","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
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.