1 research outputs found
A faster dual algorithm for the Euclidean minimum covering ball problem
Dearing and Zeck presented a dual algorithm for the problem of the minimum
covering ball in . Each iteration of their algorithm has a
computational complexity of at least . In this paper we
propose a modification to their algorithm that, together with an implementation
that uses updates to the QR factorization of a suitable matrix, achieves a
iteration.Comment: Latex; 12 pages; typo correcte