Amaldi, Edoardo; Dhyani, Kanika; Liberti, Leo - In: Computational Optimization and Applications 56 (2013) 3, pp. 619-633
In the bottleneck hyperplane clustering problem, given n points in <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$\mathbb{R}^{d}$</EquationSource> </InlineEquation> and an integer k with 1≤k≤n, we wish to determine k hyperplanes and assign each point to a hyperplane so as to minimize the maximum Euclidean distance between each point and its assigned hyperplane. This...</equationsource></inlineequation>
