105 search results - page 1 / 21 » Almost Optimal Solutions to k-Clustering Problems |
IJCGA
2010
13 years 3 months ago
2010
CJ
2010
13 years 5 months ago
2010
A silent self-stabilizing asynchronous distributed algorithms is given for constructing a kdominating set, and hence a k-clustering, of a connected network of processes with uniqu...
OL
2011
12 years 12 months ago
2011
We demonstrate that the Linear Multidimensional Assignment Problem with iid random costs is polynomially "-approximable almost surely (a. s.) via a simple greedy heuristic, f...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
In this paper we present novel algorithmic solutions for several resource processing and data transfer multicriteria optimization problems. The results of most of the presented tec...
SIGECOM
2009
ACM
13 years 11 months ago
2009
ACM
The Target Set Selection problem proposed by Kempe, Kleinberg, and Tardos, gives a nice clean combinatorial formulation for many problems arising in economy, sociology, and medicin...