The University of Southampton
University of Southampton Institutional Repository

# Identification and elimination of interior points for the minimum enclosing ball problem

Ahipasaoglu, Selin D. and Yildirim, E. Alper (2008) Identification and elimination of interior points for the minimum enclosing ball problem. SIAM Journal on Optimization, 19 (3), 1392-1396.

Record type: Article

## Abstract

Given ${\cal A} := \{a^1,\dots,a^m\} \subset \mathbb{R}^n$, we consider the problem of reducing the input set for the computation of the minimum enclosing ball of ${\cal A}$. In this note, given an approximate solution to the minimum enclosing ball problem, we propose a simple procedure to identify and eliminate points in ${\cal A}$ that are guaranteed to lie in the interior of the minimum-radius ball enclosing ${\cal A}$. Our computational results reveal that incorporating this procedure into two recent algorithms proposed by Yıldırım lead to significant speed-ups in running times especially for randomly generated large-scale problems. We also illustrate that the extra overhead due to the elimination procedure remains at an acceptable level for spherical or almost spherical input sets.

Published date: 1 November 2008
Keywords: minimum enclosing balls, input set reduction, approximation algorithms

## Identifiers

Local EPrints ID: 443142
URI: http://eprints.soton.ac.uk/id/eprint/443142
ISSN: 1052-6234
PURE UUID: c6f7df0b-8923-44ec-b024-bdd5db26e63e
ORCID for Selin D. Ahipasaoglu: orcid.org/0000-0003-1371-315X

## Catalogue record

Date deposited: 12 Aug 2020 16:31

## Contributors

Author: E. Alper Yildirim