Related papers: A Generalized Sylvester Problem and a Generalized …
In this paper we consider the problem of minimizing area subject to a volume constraint in a given convex set.
We prove a randomized version of the generalized Urysohn inequality relating mean-width to the other intrinsic volumes. To do this, we introduce a stochastic approximation procedure that sees each convex body K as the limit of intersections…
Uniformly distributed point sets on the unit sphere with and without symmetry constraints have been found useful in many scientific and engineering applications. Here, a novel variant of the Thomson problem is proposed and formulated as an…
For a family of graphs $\cal F$, the $\mathcal{F}$-Contraction problem takes as an input a graph $G$ and an integer $k$, and the goal is to decide if there exists $S \subseteq E(G)$ of size at most $k$ such that $G/S$ belongs to $\cal F$.…
The Weber problem consists of finding a point in $\mathbbm{R}^n$ that minimizes the weighted sum of distances from $m$ points in $\mathbbm{R}^n$ that are not collinear. An application that motivated this problem is the optimal location of…
The geometry of unit $N$-dimensional $\ell_{p}$ balls has been intensively investigated in the past decades. A particular topic of interest has been the study of the asymptotics of their projections. Apart from their intrinsic interest,…
We consider the problem of choosing Euclidean points to maximize the sum of their weighted pairwise distances, when each point is constrained to a ball centered at the origin. We derive a dual minimization problem and show strong duality…
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,…
This paper is about minimum cost constrained selection of inputs and outputs for generic arbitrary pole placement. The input-output set is constrained in the sense that the set of states that each input can influence and the set of states…
We study the regularity of minimizers for a variant of the soap bubble cluster problem: \begin{align*} \min \sum_{\ell=0}^N c_{\ell} P( S_\ell)\,, \end{align*} where $c_\ell>0$, among partitions $\{S_0,\dots,S_N,G\}$ of $\mathbb{R}^2$…
Designing small-sized \emph{coresets}, which approximately preserve the costs of the solutions for large datasets, has been an important research direction for the past decade. We consider coreset construction for a variety of general…
We consider a minimizing variant of the well-known \emph{No-Three-In-Line Problem}, the \emph{Geometric Dominating Set Problem}: What is the smallest number of points in an $n\times n$~grid such that every grid point lies on a common line…
This work is to provide a comprehensive treatment of the relationship between the theory of the generalized (palindromic) eigenvalue problem and the theory of the Sylvester-type equations. Under a regularity assumption for a specific matrix…
The Steiner tree problem can be stated in terms of finding a connected set of minimal length containing a given set of finitely many points. We show how to formulate it as a mass-minimization problem for $1$-dimensional currents with…
A regular polygon circumscribing another regular polygon (with a different side number) may be tightened to minimize the difference of both areas. The manuscripts computes the optimum result under the restriction that both polygons are…
The minimum dominating set problem asks for a dominating set with minimum size. First, we determine some vertices contained in the minimum dominating set of a graph. By applying a particular scheme, we ensure that the resulting graph is…
We study a random partial covering model on the $(d-1)$-dimensional unit sphere, where $N$ spherical caps are placed independently and uniformly at random, each covering a surface fraction of $1/N$. This model provides a continuous…
Two important optimization problems in the analysis of geometric data sets are clustering and sketching. Here, clustering refers to the problem of partitioning some input metric measure space (mm-space) into k clusters, minimizing some…
We consider the continuous Fermat-Weber problem, where the customers are continuously (uniformly) distributed along the boundary of a convex polygon. We derive the closed-form expression for finding the average distance from a given point…
We investigate the problem of computing a minimum set of solutions that approximates within a specified accuracy $\epsilon$ the Pareto curve of a multiobjective optimization problem. We show that for a broad class of bi-objective problems…