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

For a finite set of balls of radius $r$, the $k$-fold cover is the space covered by at least $k$ balls. Fixing the ball centers and varying the radius, we obtain a nested sequence of spaces that is called the $k$-fold filtration of the…

Let P be a set of n points in R^3. The 2-center problem for P is to find two congruent balls of minimum radius whose union covers P. We present two randomized algorithms for computing a 2-center of P. The first algorithm runs in O(n^3 log^5…

In this paper, we study the $k$-center problem of uncertain points on a graph. Given are an undirected graph $G = (V, E)$ and a set $\mathcal{P}$ of $n$ uncertain points where each uncertain point with a non-negative weight has $m$ possible…

Handling an infinite number of inequality constraints in infinite-dimensional spaces occurs in many fields, from global optimization to optimal transport. These problems have been tackled individually in several previous articles through…

A classical open problem in combinatorial geometry is to obtain tight asymptotic bounds on the maximum number of k-level vertices in an arrangement of n hyperplanes in d dimensions (vertices with exactly k of the hyperplanes passing below…

In the $k$-Center problem, we are given a graph $G=(V,E)$ with positive edge weights and an integer $k$ and the goal is to select $k$ center vertices $C \subseteq V$ such that the maximum distance from any vertex to the closest center…

Reduced k-means clustering is a method for clustering objects in a low-dimensional subspace. The advantage of this method is that both clustering of objects and low-dimensional subspace reflecting the cluster structure are simultaneously…

Say that a subset S of the plane is a "circle-center set" if S is not a subset of a line, and whenever we choose three noncollinear points from S, the center of the unique circle through those three points is also an element of S. A problem…

We prove global regularity, scattering and a priori bounds for the energy critical Maxwell-Klein-Gordon equation relative to the Coulomb gauge on (1+4)-dimensional Minkowski space. The proof is based upon a modified Bahouri-Gerard profile…

Minkowski's classical existence theorem provides necessary and sufficient conditions for a Borel measure on the unit sphere of Euclidean space to be the surface area measure of a convex body. The solution is unique up to a translation. We…

In the $k$-median problem, given a set of locations, the goal is to select a subset of at most $k$ centers so as to minimize the total cost of connecting each location to its nearest center. We study the uniform hard capacitated version of…

Center-based clustering techniques are fundamental in some areas of machine learning such as data summarization. Generic $k$-center algorithms can produce biased cluster representatives so there has been a recent interest in fair $k$-center…

We investigate the approximation of Monge--Kantorovich problems on general compact metric spaces, showing that optimal values, plans and maps can be effectively approximated via a fully discrete method. First we approximate optimal values…

Theoretical background is provided towards the mathematical foundation of the minimum enclosing ball problem. This problem concerns the determination of the unique spherical surface of smallest radius enclosing a given bounded set in the…

In this paper we present three different results dealing with the number of $(\leq k)$-facets of a set of points: 1. We give structural properties of sets in the plane that achieve the optimal lower bound $3\binom{k+2}{2}$ of $(\leq…

This paper describes the theory of Minkowski problems for geometric measures in convex geometric analysis. The theory goes back to Minkowski and Aleksandrov and has been developed extensively in recent years. The paper surveys classical and…

Let us have in S^2, R^2 or H^2 a pair of convex bodies, for S^2 different from S^2, such that the intersections of any congruent copies of them are centrally symmetric. Then our bodies are congruent circles. If the intersections of any…

The Gaussian surface area measures for $C$-pseudo-cones are studied in this paper. Using the variational arguments and the approximation methods of Schneider, we obtain the existence of solutions to the Gaussian-Minkowski problem for…

This paper presents universal algorithms for clustering problems, including the widely studied $k$-median, $k$-means, and $k$-center objectives. The input is a metric space containing all potential client locations. The algorithm must…

We prove that an approximated version of the Brunn--Minkowski inequality with volume distortion coefficient implies a Gaussian concentration-of-measure phenomenon. Our main theorem is applicable to discrete spaces.