Erratum: A mixed breadth-depth first strategy for the branch and bound tree of Euclidean k-center problems (Computational Optimization and Applications DOI: 10.1007/s10589-012-9503-x);A mixed breadth-depth first strategy for the branch and bound tree of Euclidean k-center problems

Computational Optimization and Applications

Volumn 54, Issue 3, 2013, Pages 675-703

  Fayed, Hatem A ^a   Atiya, Amir F ^a  

^a CAIRO UNIVERSITY   (Egypt)

Author keywords

Branch and bound; Breadth first; Depth first; k Center; Minimum enclosing ball

Indexed keywords

CLUSTERING ALGORITHMS; OPTIMAL SYSTEMS;

BRANCH-AND-BOUND APPROACHES; BREADTH-FIRST; DEPTH FIRST; FACILITY LOCATIONS; K-CENTER; LOWER AND UPPER BOUNDS; MINIMUM ENCLOSING BALL; SPACE REQUIREMENTS;

BRANCH AND BOUND METHOD;

ALGORITHMS; COMPUTER PROGRAMING; TREES;

EID: 84876484428     PISSN: 09266003     EISSN: 15732894     Source Type: Journal    
DOI: 10.1007/s10589-012-9509-4     Document Type: Erratum

References (25)

1. Acharya, T., Ray, A.K.: Image Processing: Principles and Applications. Wiley, New York (2005)
2. Agarwal, P.K., Procopiuc, C.M.: Exact and approximation algorithms for clustering. In: Proc. 9th ACM-SIAM Symposium on Discrete Algorithms, pp. 658-667 (1998)
3. BÇdoiu, M., Har-Peled, S., Indyk, P.: Approximate clustering via core-sets. In: Proc. 34th Annual ACM Symposium on Theory of computing (STOC'2002), pp. 250-257 (2002)
4. BÇdoiu, M., Clarkson, K.L.: Smaller core-sets for balls. In: Proc. 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 801-802 (2003)
5. Bilò, V., Caragiannis, I., Kaklamanis, C., Kanellopoulos, P.: Geometric clustering to minimize the sum of cluster sizes. In: Proc. of the European Symposium on Algorithms. LNCS, vol. 3669, pp. 460-471 (2005)
6. Blake, C.L., Merz, C.J.: UCI repository of machine learning databases. Dept. Inf. Comput. Sci., Univ. California, Tech. Rep. (1998). http://archive.ics.uci.edu/ml/datasets
7. Brandenberg, R., Roth, L.: New algorithms for k-center and extensions. J. Comb. Optim. 18, 376-392 (2009)
8. Cook, W.J.: National traveling salesman problems. http://www.tsp.gatech. edu/world/countries.html
9. Duda, R.O., Hart, P.E., Stork, D.G.: Pattern Classification, 2nd edn. Wiley, New York (2001)
10. Farahani, R.Z., Hekmatfar, M.: Facility Location: Concepts, Models, Algorithms and Case Studies. Physica-Verlag, Heidelberg (2009)
11. Fowler, R.J., Paterson, M.S., Tanimoto, S.L.: Optimal packing and covering in the plane are NP-complete. Inf. Process. Lett. 12, 133-137 (1981)
12. Gonzalez, T.F.: Clustering to minimize the maximum intercluster distance. Theor. Comput. Sci. 38, 293-306 (1985)
13. Hastie, T., Tibshirani, R., Friedman, J.H.: The Elements of Statistical Learning: Data Mining Inference, and Prediction. Springer, Berlin (2001)
14. Jain, A.K., Dubes, R.C.: Algorithms for Clustering Data. Prentice Hall, New York (1988)
15. Jain, A.K., Murthy, M.N., Flynn, P.J.: Data clustering: a review. ACM Comput. Rev. 31(3), 264-323 (1999)
16. Kowalski, G.: Information Retrieval Architecture and Algorithms. Springer, Berlin (2010)
17. Kumar, P., Mitchell, J.S.B., Yildirim, A.: Computing core-sets and approximate smallest enclosing HyperSpheres in high dimensions. In: Proc. 5th Workshop on Algorithm Engineering and Experiments, pp. 45-55. SIAM, Philadelphia (2003)
18. Kumar, P., Mitchell, J.S.B., Yildirim, A.: Approximate minimum enclosing balls in high dimensions using core-sets. ACM J. Exp. Algorithmics 8, 1-29 (2003)
19. Kumar, P.: Clustering and reconstructing large data sets. PhD thesis, Department of Computer Science, Stony Brook University (2004)
20. Kumar, P., Kumar, P.: Almost optimal solutions to k-clustering problems. Int. J. Comput. Geom. Appl. 20(4), 431-447 (2010)
21. Lev-Tov, N., Peleg, D.: Polynomial time approximation schemes for base station coverage with minimum total radii. Comput. Netw. 47, 489-501 (2005)
22. 3 and related problems. SIAM J. Comput. 13, 759-776 (1983)
23. Megiddo, N., Supowit, K.J.: On the complexity of some common geometric location problems. SIAM J. Comput. 13, 182-196 (1984)
24. Mehrotra, S.: On the implementation of a primal-dual interior point method. SIAM J. Optim. 2(4), 575-601 (1992)
25. Reinelt, G.: TSPLIB, a traveling salesman problem library. ORSA J. Comput. http://comopt.ifi.uni-heidelberg.de/software/TSPLIB95