| Item type |
SIG Technical Reports(1) |
| 公開日 |
2021-04-30 |
| タイトル |
|
|
タイトル |
On Tractable Problems of Diversity Optimization |
| タイトル |
|
|
言語 |
en |
|
タイトル |
On Tractable Problems of Diversity Optimization |
| 言語 |
|
|
言語 |
eng |
| 資源タイプ |
|
|
資源タイプ識別子 |
http://purl.org/coar/resource_type/c_18gh |
|
資源タイプ |
technical report |
| 著者所属 |
|
|
|
Nagoya University |
| 著者所属 |
|
|
|
Kyoto University |
| 著者所属 |
|
|
|
National Institute of Informatics |
| 著者所属 |
|
|
|
Kyoto University |
| 著者所属 |
|
|
|
Nagoya University |
| 著者所属(英) |
|
|
|
en |
|
|
Nagoya University |
| 著者所属(英) |
|
|
|
en |
|
|
Kyoto University |
| 著者所属(英) |
|
|
|
en |
|
|
National Institute of Informatics |
| 著者所属(英) |
|
|
|
en |
|
|
Kyoto University |
| 著者所属(英) |
|
|
|
en |
|
|
Nagoya University |
| 著者名 |
Tesshu, Hanaka
Yasuaki, Kobayashi
Kazuhiro, Kurita
See, Woo Lee
Yota, Otachi
|
| 著者名(英) |
Tesshu, Hanaka
Yasuaki, Kobayashi
Kazuhiro, Kurita
See, Woo Lee
Yota, Otachi
|
| 論文抄録 |
|
|
内容記述タイプ |
Other |
|
内容記述 |
Finding diverse solutions in combinatorial problems recently has received some attention. In this paper we study the following type of problems: given an integer k, the problem asks for k solutions such that the sum of pairwise Hamming distances between these solutions is maximized. We investigate the tractability of the “diverse version” of several classical combinatorial problems, such as finding bases of matroids, arborescences in directed graphs, bipartite matchings, shortest st-paths in directed graphs, and minimum cuts of undirected graphs. |
| 論文抄録(英) |
|
|
内容記述タイプ |
Other |
|
内容記述 |
Finding diverse solutions in combinatorial problems recently has received some attention. In this paper we study the following type of problems: given an integer k, the problem asks for k solutions such that the sum of pairwise Hamming distances between these solutions is maximized. We investigate the tractability of the “diverse version” of several classical combinatorial problems, such as finding bases of matroids, arborescences in directed graphs, bipartite matchings, shortest st-paths in directed graphs, and minimum cuts of undirected graphs. |
| 書誌レコードID |
|
|
収録物識別子タイプ |
NCID |
|
収録物識別子 |
AN1009593X |
| 書誌情報 |
研究報告アルゴリズム（AL）
巻 2021-AL-183,
号 1,
p. 1-6,
発行日 2021-04-30
|
| ISSN |
|
|
収録物識別子タイプ |
ISSN |
|
収録物識別子 |
2188-8566 |
| Notice |
|
|
|
SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc. |
| 出版者 |
|
|
言語 |
ja |
|
出版者 |
情報処理学会 |
IPSJ-AL21183001.pdf (857.4 kB)
