Minimum clique partition in unit disk graphs

Details Minimum clique partition in unit disk graphs Minimum clique partition in unit disk graphs

2009-09-08

arxiv.org/abs/0909.1552v1

Computer Science

Computational Geometry

12 pages, 3 figures

Scientific paper

The minimum clique partition (MCP) problem is that of partitioning the vertex set of a given graph into a minimum number of cliques. Given $n$ points in the plane, the corresponding unit disk graph (UDG) has these points as vertices, and edges connecting points at distance at most~1. MCP in unit disk graphs is known to be NP-hard and several constant factor approximations are known, including a recent PTAS. We present two improved approximation algorithms for minimum clique partition in unit disk graphs: (I) A polynomial time approximation scheme (PTAS) running in time $n^{O(1/\eps^2)}$. This improves on a previous PTAS with $n^{O(1/\eps^4)}$ running time \cite{PS09}. (II) A randomized quadratic-time algorithm with approximation ratio 2.16. This improves on a ratio 3 algorithm with $O(n^2)$ running time \cite{CFFP04}.

Affiliated with

Also associated with

No associations

Rating

Minimum clique partition in unit disk graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Minimum clique partition in unit disk graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Minimum clique partition in unit disk graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-384772