Show simple item record

dc.contributor.authorAhıpaşaoǧlu, S. D.en_US
dc.contributor.authorYıldırım, E. A.en_US
dc.date.accessioned2016-02-08T10:06:49Z
dc.date.available2016-02-08T10:06:49Z
dc.date.issued2008en_US
dc.identifier.issn1052-6234
dc.identifier.urihttp://hdl.handle.net/11693/22942
dc.description.abstractGiven A := {a1,...,am} C ℝn, we consider the problem of reducing the input set for the computation of the minimum enclosing ball of 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.A that are guaranteed to lie in the interior of the minimum-radius ball enclosing A. Our computational results reveal that incorporating this procedure into two recent algorithms proposed by Yildirim lead to significant speed-ups in running times especially for randomly generated largescale 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.en_US
dc.language.isoEnglishen_US
dc.source.titleSIAM Journal on Optimizationen_US
dc.relation.isversionofhttp://dx.doi.org/10.1137/080727208en_US
dc.subjectMinimum enclosing ballsen_US
dc.subjectInput set reductionen_US
dc.subjectApproximation algorithmsen_US
dc.titleIdentification and elimination of interior points for the minimum enclosing ball problemen_US
dc.typeArticleen_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.citation.spage1392en_US
dc.citation.epage1396en_US
dc.citation.volumeNumber19en_US
dc.citation.issueNumber3en_US
dc.identifier.doi10.1137/080727208en_US
dc.publisherSociety for Industrial and Applied Mathematicsen_US
dc.identifier.eissn1095-7189


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record