3 papers
cs.DS2026
Multiplication of 0-1 matrices via clustering
Jesper Jansson, Miroslaw Kowaluk, Andrzej Lingas +1
We study applications of clustering (in particular, the -center clustering problem) in the design of efficient and practical algorithms for computing an approximate and the exac…
cs.DS2025
Fast approximate -center clustering in high dimensional spaces
MirosÅaw Kowaluk, Andrzej Lingas, Mia Persson
We study the design of efficient approximation algorithms for the -center clustering and minimum-diameter -clustering problems in high dimensional Euclidean and Hamming…
cs.DS2025
Approximate all-pairs Hamming distances and 0-1 matrix multiplication
Miroslaw Kowaluk, Andrzej Lingas, Mia Persson
Arslan showed that computing all-pairs Hamming distances is easily reducible to arithmetic 0-1 matrix multiplication (IPL 2018). We provide a reverse, linear-time reduction of arit…