### Table 3: Comparison of NetScan and Greedy k-center.

"... In PAGE 10: ... We ran NetScan for the Connected k-Center problem and a known heuristic algorithm (Greedy k- center) [15] for the traditional k-center problem, both with k = 3. Table3 reports the clustering results av- eraged over 20 runs for both algorithms, recording the number of correctly identified professors for each com- munity together with the overall accuracy. To calculate the accuracy, we associated each of the three communi- ties with one of the clusters such that the best overall accuracy was achieved.... ..."

### Table 4.1: Comparison of k-center methods

2004

### Table 1. Results

"... In PAGE 4: ... We also provide approximation algorithms for several variations of the K-center problem and the K-suppliers problem for arbitrarily many time-slots, including weights and costs, with factors that are close to the best possible unless P = NP. These results are summarized in Table1 . The only known lower bound for anyoftheK-center problems is 2, the lower bound for the basic K-center problem.... ..."

### Table 1. Results

"... In PAGE 4: ... We also provide approximation algorithms for several variations of the K-center problem and the K-suppliers problem for arbitrarily many time-slots, including weights and costs, with factors that are close to the best possible unless P = NP. These results are summarized in Table1 . The only known lower bound for any of the K-center problems is 2, the lower bound for the basic K-center problem.... ..."

### Table 1. The speedup and efficiency for explicit Euler algorithm on PC cluster.

2005

"... In PAGE 5: ... A detailed description of the problem is given in [3]. In Table1 , the results of testing ParSol on PC cluster Vilkas of Vilnius Gediminas technical university are presented. PC clusters are known for their high communication latency thus the efficiency of parallel algorithms can be reduced for small computational problems when communication costs are relatively very high.... ..."

### Table 1. The Efficient Graph Clustering Algorithm.

2000

Cited by 20

### Table 1. The Efficient Graph Clustering Algorithm.

2000

Cited by 20

### Table 1. The Efficient Graph Clustering Algorithm.

2000

Cited by 20