Search
Skip to Search Results
Filter
Subject / Keyword
Author / Creator / Contributor
Year
Collections
Languages
Item type
-
2009
Salavatipour, Mohammad, Pirwani, Imran
Technical report TR09-06. We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor approximations are known, with the current best ratio of 3. Our main result is a polynomial...
1 - 1 of 1