Related papers: Qualitative Properties of $k-$Center Problems
In this paper, we introduce and study the following problem and its further generalizations: given two finite collections of sets in a normed space, find a ball whose center lies in a given constraint set with the smallest radius that…
The Minkowski problem in convex geometry concerns showing that a given Borel measure on the unit sphere is, up to perhaps a constant, some type of surface area measure of a convex body. Two types of Minkowski problems in particular are an…
In this work, we review the concept of center of a geometric object as an equivariant map, unifying and generalizing different approaches followed by authors such as C. Kimberling or A. Edmonds. We provide examples to illustrate that this…
The classical Minkowski problem in Minkowski space asks, for a positive function $\phi$ on $\mathbb{H}^d$, for a convex set $K$ in Minkowski space with $C^2$ space-like boundary $S$, such that $\phi(\eta)^{-1}$ is the Gauss--Kronecker…
An explicit solution to the Christoffel-Minkowski problem for convex bodies of revolution is presented. The conditions on the prescribed measure involve only first moments over spherical caps, and the support function of the resulting…
We solve the truncated K-moment problem when $K\subseteq R^n$ is the closure of a, not necessarily bounded, open set (which includes the important cases $K=R^n$ and $K=R^n_+$). That is, we completely characterize the interior of the convex…
This paper considers the radii functionals (circumradius, inradius, and diameter) as well as the Minkowski asymmetry for general (possibly non-symmetric) gauge bodies. A generalization of the concentricity inequality (which states that the…
Lattice coverings in the real plane by Minkowski balls are studied. We exploit the duality of admissible lattices of Minkowski balls and inscribed convex symmetric hexagons of these balls. An explicit moduli space of the areas of these…
Inside a fixed bounded domain $\Omega$ of the plane, we look for the best compact connected set $K$, of given perimeter, in order to maximize the first Dirichlet eigenvalue $\lambda_1(\Omega\setminus K)$. We discuss some of the qualitative…
We study a generalization of $k$-center clustering, first introduced by Kavand et. al., where instead of one set of centers, we have two types of centers, $p$ red and $q$ blue, and where each red center is at least $\alpha$ distant from…
The current work focuses on the Gaussian-Minkowski problem in dimension 2. In particular, we show that if the Gaussian surface area measure is proportional to the spherical Lebesgue measure, then the corresponding convex body has to be a…
We are concerned with spacelike convex hypersurfaces of positive constant (K-hypersurfaces) or prescribed Gauss curvature in Minkowski space. Our main purpose is to study entire solutions as well as the Dirichlet problem in bounded domains…
$\renewcommand{\Re}{\mathbb{R}}$ We develop a general randomized technique for solving "implic it" linear programming problems, where the collection of constraints are defined implicitly by an underlying ground set of elements. In many…
We derive universal lower and upper bounds for max-min and min-max problems (also known as polarization) for the potential of spherical $(k,k)$-designs and provide certain examples, including unit-norm tight frames, that attain these…
In data summarization we want to choose $k$ prototypes in order to summarize a data set. We study a setting where the data set comprises several demographic groups and we are restricted to choose $k_i$ prototypes belonging to group $i$. A…
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice. Theoretically, however, the best known upper bound on its…
The $k$-center problem is a classical combinatorial optimization problem which asks to find $k$ centers such that the maximum distance of any input point in a set $P$ to its assigned center is minimized. The problem allows for elegant…
The convergence of inexact Newton methods is studied for solving generalized equations on Riemannian manifolds by using the metric regularity property, which is also explored. Under appropriate conditions and without any additional…
The paper characterizes the convex hull of the closure of the cone-volume set $C_\cv(U)$, consisting of all cone-volume vectors of polygons with outer unit normals vectors contained in $U$, for any finite set $U \subseteq \R^2, \pos(U) =…
Methodology is provided towards the solution 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 d-dimensional Euclidean…