RA-001 On (k,r)-gatherings on a Road

• Item type: FIT(1)
• 公開日: 2013-08-20
• タイトル / 言語: en
• タイトル: RA-001 On (k,r)-gatherings on a Road
• 言語: eng
• 資源タイプ / 資源タイプ識別子: http://purl.org/coar/resource_type/c_5794
• 資源タイプ: conference paper
• 著者所属: 群馬大
• 著者所属: 群馬大
• 著者所属(英): en
• 著者所属(英): Department of Computer Science, Gunma University
• 著者所属(英): en
• 著者所属(英): Department of Computer Science, Gunma University
• 著者名: 赤木, 俊裕; 中野, 眞一
• 著者名(英): Akagi, Toshihiro; Nakano, Shin-ichi
• 論文抄録(英) / 内容記述タイプ: Other
• 論文抄録(英) / 内容記述: Given two integers k and r, a set of customer locations C, and a set of potential facility locations F, we wish to compute an assignment A of C to F such that (1) for each c ∈ C the distance between c and A(c) ∈ F is at most k, and (2) for each f ∈ F the number of customers assigned to f is either zero or at least r. Such an assignment is called a (k,r)-gathering of C to F. Intuitively we wish to assign customers to near "open" facilities so that each "open" facility has an enough number of customers, namely r or more customers. In this paper we solve the problem in linear time when the customer locations and potential facility locations
• 書誌レコードID / 収録物識別子タイプ: NCID
• 書誌レコードID / 収録物識別子: AA1242354X
• 書誌情報: 情報科学技術フォーラム講演論文集; 巻 12, 号 1, p. 1-8, 発行日 2013-08-20
• 出版者 / 言語: ja
• 出版者: 情報処理学会