Related papers: A Generalized Sylvester Problem and a Generalized …
In the standard planar $k$-center clustering problem, one is given a set $P$ of $n$ points in the plane, and the goal is to select $k$ center points, so as to minimize the maximum distance over points in $P$ to their nearest center. Here we…
In this paper we consider the isoperimetric problem with double density in an Euclidean space, that is, we study the minimisation of the perimeter among subsets of $\mathbb{R}^n$ with fixed volume, where volume and perimeter are relative to…
The subset sum problem is one of the simplest and most fundamental NP-hard problems in combinatorial optimization. We consider two extensions of this problem: The subset sum problem with digraph constraint (SSG) and subset sum problem with…
We prove the existence of global minimizers to the double minimization problem \[ \inf\Big\{ P(E) + \lambda W_p(\mathcal{L}^n \lfloor \, E,\mathcal{L}^n \lfloor\, F) \colon |E \cap F| = 0, \, |E| = |F| = 1\Big\}, \] where $P(E)$ denotes the…
The generalized soap bubble problem seeks the least perimeter way to enclose and separate n given volumes in R^m. We study the possible configurations for perimeter minimizing bubble complexes enclosing more than two regions. We prove that…
We prove a variant of the Sylvester-Gallai theorem for cubics (algebraic curves of degree three): If a finite set of sufficiently many points in $\mathbb{R}^2$ is not contained in a cubic, then there is a cubic that contains exactly nine of…
Given a compact subset of a Banach space, the Chebyshev center problem consists of finding a minimal circumscribing ball containing the set. In this article we establish a numerically tractable algorithm for solving the Chebyshev center…
We look for minimizers of the buckling load problem with perimeter constraint in any dimension. In dimension 2, we show that the minimizing plates are convex; in higher dimension, by passing through a weaker formulation of the problem, we…
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 problem of finding "small" sets that meet every straight-line which intersects a given convex region was initiated by Mazurkiewicz in 1916. We call such a set an {\em opaque set} or a {\em barrier} for that region. We consider the…
Given a finite set, $X$, of points in projective space for which the Hilbert function is known, a standard result says that there exists a subset of this finite set whose Hilbert function is ``as big as possible'' inside $X$. Given a finite…
We study the problem of super-resolution of a linear combination of Dirac distributions and their derivatives on a one-dimensional circle from noisy Fourier measurements. Following numerous recent works on the subject, we consider the…
In the Non-Uniform $k$-Center problem, a generalization of the famous $k$-center clustering problem, we want to cover the given set of points in a metric space by finding a placement of balls with specified radii. In $t$-NU$k$C Problem, we…
We study the problem of covering a given set of $n$ points in a high, $d$-dimensional space by the minimum enclosing polytope of a given arbitrary shape. We present algorithms that work for a large family of shapes, provided either only…
We present a general solution and formulation framework to Bellman's lost-in-a-forest problem. The forest boundary is known and may take any shape. The starting point and the orientation are unspecified. We convert the problem into…
We generalized the Steiner's shortest line problem and found its connection with the concepts in classical field theory. We solved the generalized Steiner's problem by introducing a conservative potential and a dissipative force in the…
Two planar sets are circularly separable if there exists a circle enclosing one of the sets and whose open interior disk does not intersect the other set. This paper studies two problems related to circular separability. A linear-time…
Levenshtein first introduced the sequence reconstruction problem in $2001$. In the realm of combinatorics, the sequence reconstruction problem is equivalent to determining the value of $N(n,d,t)$, which represents the maximum size of the…
We solve the problem of best approximation by Parseval frames to an arbitrary frame in a subspace of an infinite dimensional Hilbert space. We explicitly describe all the solutions and we give a criterion for uniqueness. This best…
We define the parametric closure problem, in which the input is a partially ordered set whose elements have linearly varying weights and the goal is to compute the sequence of minimum-weight lower sets of the partial order as the weights…