WEKO3
-
RootNode
アイテム
On a Generalization of a Covering Problem Called Single Cover on Undirected Flow Networks
http://hdl.handle.net/10191/6523
http://hdl.handle.net/10191/6523fb5c7c82-f542-4905-87d3-46740bc78132
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
e80-a_3_544.pdf (527.9 kB)
|
|
| Item type | 学術雑誌論文 / Journal Article(1) | |||||
|---|---|---|---|---|---|---|
| 公開日 | 2008-07-28 | |||||
| タイトル | ||||||
| タイトル | On a Generalization of a Covering Problem Called Single Cover on Undirected Flow Networks | |||||
| タイトル | ||||||
| タイトル | On a Generalization of a Covering Problem Called Single Cover on Undirected Flow Networks | |||||
| 言語 | en | |||||
| 言語 | ||||||
| 言語 | eng | |||||
| キーワード | ||||||
| 主題Scheme | Other | |||||
| 主題 | graphs and networks | |||||
| キーワード | ||||||
| 主題Scheme | Other | |||||
| 主題 | flow network | |||||
| キーワード | ||||||
| 主題Scheme | Other | |||||
| 主題 | location theory | |||||
| キーワード | ||||||
| 主題Scheme | Other | |||||
| 主題 | covering problem | |||||
| 資源タイプ | ||||||
| 資源 | http://purl.org/coar/resource_type/c_6501 | |||||
| タイプ | journal article | |||||
| 著者 |
Tamura, Hiroshi
× Tamura, Hiroshi× Sugawara, Hidehito× Sengoku, Masakazu× Shinoda, Shoji |
|||||
| 著者別名 | ||||||
| 識別子Scheme | WEKO | |||||
| 識別子 | 6181 | |||||
| 姓名 | 仙石, 正和 | |||||
| 抄録 | ||||||
| 内容記述タイプ | Abstract | |||||
| 内容記述 | Location theory on networks is concerned with the problem of selecting the best location in a specified network for facilities. Many studies for the theory have been done. We have studied location theory from the standpoint of measuring the closeness between two vertices by the capacity (maximum flow value) between two vertices. In a previous paper, we have considered location problems, called covering problems and proposed polynomial time algorithms for these problems. These problems are applicable to assigning files to some computers in a computer network. This paper is concerned with a covering problem called the single cover problem defined in the previous paper. First, we define a generalized single cover problem and show that an algorithm proposed in the previous paper can be applicable to solving the generalized single cover problem. Then, we define a single cover problem satisfying cardinality constrains and show that the problem is solved in a polynomial time. | |||||
| 書誌情報 |
IEICE transactions on fundamentals of electronics, communications and computer sciences en : IEICE transactions on fundamentals of electronics, communications and computer sciences 巻 E80-A, 号 3, p. 544-550, 発行日 1997-03 |
|||||
| 出版者 | ||||||
| 出版者 | The Institute of Electronics, Information and Communication Engineers | |||||
| ISSN | ||||||
| 収録物識別子タイプ | ISSN | |||||
| 収録物識別子 | 09168508 | |||||
| 書誌レコードID | ||||||
| 収録物識別子タイプ | NCID | |||||
| 収録物識別子 | AA10826239 | |||||
| 権利 | ||||||
| 権利情報 | copyright©1997 IEICE | |||||
| 著者版フラグ | ||||||
| 値 | publisher | |||||
| 異版である | ||||||
| 関連タイプ | isVersionOf | |||||
| 識別子タイプ | URI | |||||
| 関連識別子 | http://www.ieice.org/jpn/trans_online/ | |||||
