Now showing items 1-3 of 3

    • An algorithm and a core set result for the weighted euclidean one-center problem 

      Kumar, P.; Yıldırım, A. E. (Institute for Operations Research and the Management Sciences (I N F O R M S), 2009)
      Given a set A of m points in n-dimensional space with corresponding positive weights, the weighted Euclidean one-center problem, which is a generalization of the minimum enclosing ball problem, involves the computation of ...
    • Identification and elimination of interior points for the minimum enclosing ball problem 

      Ahıpaşaoǧlu, S. D.; Yıldırım, E. A. (Society for Industrial and Applied Mathematics, 2008)
      Given 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 ...
    • Two algorithms for the minimum enclosing ball problem 

      Yıldırım, E. A. (Society for Industrial and Applied Mathematics, 2008)
      Given A := {a1.....am} ⊂ ℝn and ε > 0, we propose and analyze two algorithms for the problem of computing a (1 + ε)-approximation to the radius of the minimum enclosing ball of A. The first algorithm is closely related ...