Related papers: The Smallest Enclosing Ball Problem and the Smalle…

In this work we consider the problem of finding the minimum-weight loop cover of an undirected graph. This combinatorial optimization problem is called 2-matching and can be seen as a relaxation of the traveling salesman problem since one…

We study the double bubble problem with perimeter taken with respect to the $\ell_1$ norm on $\mathbb{R}^2$. We give an elementary proof for the existence of minimizing sets for any volume ratio parameter $0<\alpha\le1$ by direct comparison…

We report (to our knowledge) the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration of symbol occurrences can provide search heuristics that…

We consider the {\em clustering with diversity} problem: given a set of colored points in a metric space, partition them into clusters such that each cluster has at least $\ell$ points, all of which have distinct colors. We give a…

Finding point configurations, that yield the maximum polarization (Chebyshev constant) is gaining interest in the field of geometric optimization. In the present article, we study the problem of unconstrained maximum polarization on compact…

We establish a structure theorem for minimizing sequences for the isoperimetric problem on noncompact $\mathsf{RCD}(K,N)$ spaces $(X,\mathsf{d},\mathcal{H}^N)$. Under the sole (necessary) assumption that the measure of unit balls is…

We look for the minimizers of the functional $\jla{\la}(\oo)=\la|\oo|-P(\oo)$ among planar convex domains constrained to lie into a given ring. We prove that, according to the values of the parameter $\la$, the solutions are either a disc…

In this article we investigate the $N$-point min-max and the max-min polarization problems on the sphere for a large class of potentials in $\mathbb{R}^n$. We derive universal lower and upper bounds on the polarization of spherical designs…

This article provides numerical evidence that under volume constraint the ball is the set which maximizes the perimeter of the least-perimeter partition into cells with prescribed areas. We introduce a numerical maximization algorithm which…

In this paper, we study several important geometric optimization problems arising in machine learning. First, we revisit the Minimum Enclosing Ball (MEB) problem in Euclidean space $\mathbb{R}^d$. The problem has been extensively studied…

The problem of packing a set of circles into the smallest surrounding container is considered. This problem arises in different application areas such as automobile, textile, food, and chemical industries. The so-called circle packing…

A typical computational geometry problem begins: Consider a set P of n points in R^d. However, many applications today work with input that is not precisely known, for example when the data is sensed and has some known error model. What if…

In the MINIMUM CONVEX COVER (MCC) problem, we are given a simple polygon $\mathcal P$ and an integer $k$, and the question is if there exist $k$ convex polygons whose union is $\mathcal P$. It is known that MCC is $\mathsf{NP}$-hard…

Let $\xi$ be a real random variable with mean zero and variance one and $A={a_1,...,a_n}$ be a multi-set in $\R^d$. The random sum $$S_A := a_1 \xi_1 + ... + a_n \xi_n $$ where $\xi_i$ are iid copies of $\xi$ is of fundamental importance in…

The Chebyshev set of a bounded set $K$ in a normed space is the set of centers of all minimal enclosing balls of $K$. We use the concept of ball intersection and ball hull operators to derive new properties of Chebyshev sets in normed…

We consider the entanglement marginal problem, which consists of deciding whether a number of reduced density matrices are compatible with an overall separable quantum state. To tackle this problem, we propose hierarchies of semidefinite…

In this manuscript we introduce and study an extended version of the minimal dispersion of point sets, which has recently attracted considerable attention. Given a set $\mathscr P_n=\{x_1,\dots,x_n\}\subset [0,1]^d$ and…

We study the size (or volume) of balls in the metric space of permutations, $S_n$, under the infinity metric. We focus on the regime of balls with radius $r = \rho \cdot (n\!-\!1)$, $\rho \in [0,1]$, i.e., a radius that is a constant…

It is a well known fact that in $\mathbb{R}^n$ a subset of minimal perimeter $L$ among all sets of a given volume is also a set of maximal volume among all sets of the same perimeter $L$. This is called the reciprocity principle for…

In the present work, the problem about shadow, generalized on domains of space $\mathbb{R}^n$, $n\le 3$, is investigated. Here the shadow problem means to find the minimal number of balls satisfying some conditions an such that every line…