Cluster connecting problem inside a polygon

13 years 6 months ago

Download www.cs.umanitoba.ca

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.

Sanjib Sadhu, Arijit Bishnu, Subhas C. Nandy, Part

Real-time Traffic

CCCG 2010 | Cluster Connecting Problem | Computational Geometry | N-factor Approximation Algorithm | Simple Polygon |

claim paper

» Simple Robots in Polygonal Environments A Hierarchy

» Feedlinks for network extensions

» Applications of Parametric Searching in Geometric Optimization

» Autonomous networked robots for the establishment of wireless communication in uncertain e...

» EndtoEnd Performance Monitoring of Databases in Distributed Environments

Post Info
More Details (n/a)

Added	29 Oct 2010
Updated	29 Oct 2010
Type	Conference
Year	2010
Where	CCCG
Authors	Sanjib Sadhu, Arijit Bishnu, Subhas C. Nandy, Partha P. Goswami

Comments (0)

Sciweavers

Cluster connecting problem inside a polygon

CCCG 2010 | Cluster Connecting Problem | Computational Geometry | N-factor Approximation Algorithm | Simple Polygon |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers