Related papers: Qualitative Properties of $k-$Center Problems

Chv\'{a}tal and Klincsek (1980) gave an $O(n^3)$-time algorithm for the problem of finding a maximum-cardinality convex subset of an arbitrary given set $P$ of $n$ points in the plane. This paper examines a generalization of the problem,…

We develop two types of integral formulas for the perimeter of a convex body K in planar geometries. We derive Cauchy-type formulas for perimeter in planar Hilbert geometries. Specializing to H^2 we get a formula that appears to be new. We…

One of the most fruitful results from Minkowski's geometric viewpoint on number theory is his so called 1st Fundamental Theorem. It provides an optimal upper bound for the volume of an o-symmetric convex body whose only interior lattice…

A new method is introduced for solving Laplace problems on 2D regions with corners by approximation of boundary data by the real part of a rational function with fixed poles exponentially clustered near each corner. Greatly extending a…

Given a set $P$ of $n$ points in the plane, the $k$-center problem is to find $k$ congruent disks of minimum possible radius such that their union covers all the points in $P$. The $2$-center problem is a special case of the $k$-center…

The concept of convex compactness, weaker than the classical notion of compactness, is introduced and discussed. It is shown that a large class of convex subsets of topological vector spaces shares this property and that is can be used in…

The Non-Uniform $k$-center (NUkC) problem has recently been formulated by Chakrabarty, Goyal and Krishnaswamy [ICALP, 2016] as a generalization of the classical $k$-center clustering problem. In NUkC, given a set of $n$ points $P$ in a…

Generalized circumcenters have been recently introduced and employed to speed up classical projection-type methods for solving feasibility problems. In this note, circumcenters are enforced in a new setting; they are proven to provide…

The $k$-center problem requires the selection of $k$ points (centers) from a given metric pointset $W$ so to minimize the maximum distance of any point of $W$ from the closest center. This paper focuses on a fair variant of the problem,…

The mixed Christoffel-Minkowski problem asks for necessary and sufficient conditions for a Borel measure on the Euclidean unit sphere to be the mixed area measure of some convex bodies, one of which, appearing multiple times, is free and…

We study the time complexity of the discrete $k$-center problem and related (exact) geometric set cover problems when $k$ or the size of the cover is small. We obtain a plethora of new results: - We give the first subquadratic algorithm for…

A new way to define the notion of $\C$-orthocenter will be displayed by studying some propierties of four points in the plane which allows to extend the notion of Euler's line, the Six Point Circles and the three-circles theorem, for normed…

This paper concerns the global theory of properly embedded spacelike surfaces in three-dimensional Minkowski space in relation to their Gaussian curvature. We prove that every regular domain which is not a wedge is uniquely foliated by…

The Kepler problem is a dynamical system that is well defined not only on the Euclidean plane but also on the sphere and on the Hyperbolic plane. First, the theory of central potentials on spaces of constant curvature is studied. All the…

A series of basic qualitative properties of the minimum sum-of-squares clustering problem are established in this paper. Among other things, we clarify the solution existence, properties of the global solutions, characteristic properties of…

In this paper we explore questions regarding the Minkowski sum of the boundaries of convex sets. Motivated by a question suggested to us by V.~Milman regarding the volume of $\partial K+ \partial T$ where $K$ and $T$ are convex bodies, we…

We study the complexity of the classic capacitated k-median and k-means problems parameterized by the number of centers, k. These problems are notoriously difficult since the best known approximation bound for high dimensional Euclidean…

We combine functional analytic and geometric viewpoints on approximate Birkhoff and isosceles orthogonality in generalized Minkowski spaces which are finite-dimensional vector spaces equipped with a gauge. This is the first approach to…

The $k$-center problem is a classical clustering problem in which one is asked to find a partitioning of a point set $P$ into $k$ clusters such that the maximum radius of any cluster is minimized. It is well-studied. But what if we add up…

Suppose $A \in \mathbb{R}^{n \times n}$ is invertible and we are looking for the solution of $Ax = b$. Given an initial guess $x_1 \in \mathbb{R}$, we show that by reflecting through hyperplanes generated by the rows of $A$, we can generate…