164
click to vote
SWAT
15 years 8 months ago
2010 Springer 
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 a...
152
Voted
SWAT
15 years 1 months ago
2010 Springer 
As Bin Packing is NP-hard already for k = 2 bins, it is unlikely to be solvable in polynomial time even if the number of bins is a fixed constant. However, if the sizes of the item...
144
click to vote
SWAT
15 years 8 months ago
2010 Springer 
Unit Clustering is the problem of dividing a set of points from a metric space into a minimal number of subsets such that the points in each subset are enclosable by a unit ball. W...
120
click to vote
SWAT
15 years 8 months ago
2010 Springer
We attend to the classic setting where an observer needs to inform a tracker about an arbitrary time varying function f : N0 → Z. This is an optimization problem, where both wron...
|
Algorithms