No title
We study applications of clustering (in particular the k-center clustering problem) in the design of efficient and practical deterministic algorithms for computing an approximate and the exact arithmetic matrix product of two 0-1 rectangular matrices A and B with clustered rows or columns, respectively. Let λA and λB denote the minimum maximum radius of a cluster in an ℓ-center clustering of the r
