Cluster connecting problem inside a polygon

The cluster connecting problem inside a simple polygon is introduced in this paper. The problem is shown to be NP-complete. A log n-factor approximation algorithm is proposed.

• Type: Conference
• Year: 2010
• Where: CCCG
• Authors: Sanjib Sadhu, Arijit Bishnu, Subhas C. Nandy, Partha P. Goswami
• Keywords: CCCG 2010, Cluster Connecting Problem, Computational Geometry, N-factor Approximation Algorithm, Simple Polygon