Effective Use of Geometric Information for Clustering and Related Topics

スポンサーリンク

概要

• 論文の詳細を見る

• This paper surveys how geometric information can be effectively used for efficient algorithms with focus on clustering problems. Given a complete weighted graph G of n vertices, is there a partition of the vertex set into k disjoint subsets so that the maximum weight of an innercluster edge (whose two endpoints both belong to the same subset) is minimized? This problem is known to be NP-complete even for k = 3. The case of k = 2, that is, bipartition problem is solvable in polynomial time. On the other hand, in geometric setting where vertices are points in the plane and weights of edges equal the distances between corresponding points, the same problem is solvable in polynomial time even for k ≧ 3 as far as k is a fixed constant. For the case k = 2, effective use of geometric property of an optimal solution leads to considerable improvement on the computational complexity. Other related topics are also discussed.

• 社団法人電子情報通信学会の論文
• 2000-03-25

著者

• Asano Tetsuo

  The School Of Information Science Japan Advanced Institute Of Science And Technology

関連論文

• Effective Use of Geometric Information for Clustering and Related Topics

スポンサーリンク