| 1 |
T. Feder and D. Greene, "Optimal algorithms for approximate clustering," Proceedings of the 20th Annual ACM Symposium on Theory of Computing, Chicago: IL, pp. 434-444, 1988.
|
| 2 |
P. K. Agarwal and C. M. Procopiuc, "Exact and approximation algorithms for clustering," Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco: CA, pp. 658-667, 1998.
|
| 3 |
S. Arora, P. Raghavan, and S. Rao, "Approximation schemes for Euclidean k-medians and related problems," Proceedings of the 30th Annual ACM Symposium on Theory of Computing, Dallas: TX, pp. 106-113, 1998.
|
| 4 |
N. Megiddo, "Linear-time algorithms for linear programming in  and related problems," SIAM Journal on Computing, vol. 12, no. 4, pp. 759-776, 1983.
DOI
|
| 5 |
F. R. K. Chung, "The average distance and the independence number," Journal of Graph Theory, vol. 12, no. 2, pp. 229-235, 1988.
DOI
|
| 6 |
P. Dankelmann, "Computing the average distance of an interval graph," Information Processing Letters, vol. 48, no. 6, pp. 311- 314, 1993.
DOI
ScienceOn
|
| 7 |
S. L. Hakimi, "Location theory," in Handbook of Discrete and Combinatorial Mathematics. Boca Raton: CRC Press, pp. 986-995, 2000.
|
| 8 |
P. Indyk, "Sublinear time algorithms for metric space problems," Proceedings of the 31st Annual ACM Symposium on the Theory of Computing, Atlanta: GA, pp. 428-434, 1999.
|
| 9 |
P. Bose, A. Maheshwari, and P. Morin, "Fast approximations for sums of distances, clustering and Fermat-Weber problem," Computational Geometry: Theory and Applications, vol. 24, no. 3, pp. 135-146, 2003.
DOI
ScienceOn
|
| 10 |
R. Hassin and A. Tamir, "Improved complexity bounds for location problems on the real line," Operations Research Letters, vol. 10, no. 7, pp. 395-402, 1991.
DOI
ScienceOn
|
| 11 |
N. Megiddo and K. J. Supowit, "On the complexity of some common geometric location problems," SIAM Journal on Computing, vol. 13, no. 1, pp. 182-196, 1984.
DOI
ScienceOn
|
| 12 |
Z. Drezner, "The planar two-center and two-median problems," Transportation Science, vol. 18, no. 4, pp. 351-361, 1984.
DOI
ScienceOn
|
| 13 |
G. N. Frederickson, "Parametric search and locating supply centers in trees," Proceedings of the 2nd Workshop on Algorithms and Data Structure, Ottawa, pp. 299-319, 1991.
|
| 14 |
T. F. Gonzalez, "Clustering to minimize the maximum intercluster distance," Theoretical Computer Science, vol. 38, pp. 293-306, 1985.
DOI
ScienceOn
|
| 15 |
D. S. Hochbaum and D. B. Shmoys, "A unified approach to approximate algorithms for bottleneck problems," Journal of the ACM, vol. 33, no. 3, pp. 533-550, 1986.
DOI
ScienceOn
|
| 16 |
P. K. Agarwal, M. Sharir, and S. Toledo, "An efficient multi-dimensional searching technique and its applications," Duke University, Durham: NC, Technical Report CS-1993-20, 1993.
|
| 17 |
B. Chazelle and J. Matousek, "On linear-time deterministic algorithms for optimization problems in fixed dimension," Journal of Algorithms, vol. 21, no. 3, pp. 579-597, 1996.
DOI
ScienceOn
|
| 18 |
D. Eppstein, "Dynamic three-dimensional linear programming," ORSA Journal on Computing, vol. 4, no. 4, pp. 360-368, 1992.
DOI
|
| 19 |
J. Hershberger, "A faster algorithm for the two-center decision problem," Information Processing Letters, vol. 47, no. 1, pp. 23-29, 1993.
DOI
ScienceOn
|
| 20 |
P. K. Agarwal and M. Sharir, "Planar geometric location problems," Algorithmica, vol. 11, pp. 185-195, 1994.
DOI
|
| 21 |
M. J. Katz and M. Sharir, "An expander-based approach to geometric optimization," Proceedings of the 9th Annual Symposium on Computational Geometry, San Diego: CA, pp. 198-207, 1993.
|
| 22 |
M. Sharir, "A near-linear algorithm for the planar 2-center problem," Discrete and Computational Geometry, vol. 18, no. 2, pp. 125-134, 1997.
DOI
|
| 23 |
T. M. Chan, "More planar two-center algorithms," Computational Geometry, vol. 13, no. 3, pp. 189-198, 1999.
DOI
ScienceOn
|
| 24 |
P. K. Agarwal and M. Sharir, "Efficient algorithms for geometric optimization", ACM Computing Surveys, vol. 30, no. 4, pp. 412-458, 1998.
DOI
ScienceOn
|
webmaster
