Classical approaches to location problems are based on the minimization of the average distance (the median concept) or the minimization of the maximum distance (the center concept...
An algorithm, described by Sedgewick, finds the distance between the closest pair of n given points in a plane using a variant of mergesort. This takes O(n log n) time. To prove t...
Generalization of the covariance concept is discussed for mixed categorical and numerical data. Gini's definition of variance for categorical data gives us a starting point to...