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

スポンサーリンク

概要

• 論文の詳細を見る

• 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

• FIT(電子情報通信学会・情報処理学会)運営委員会の論文
• 2013-08-20

著者

• 中野 眞一

  群馬大

• 赤木 俊裕

  群馬大

関連論文

• RA-001 Two Compact Codes for Rectangular Drawings with Degree Four Vertices
• RA-001 On (k,r)-gatherings on a Road

スポンサーリンク