Related papers: A minimal partition problem with trace constraint …
The submodular partitioning problem asks to minimize, over all partitions $P$ of a ground set $V$, the sum of a given submodular function $f$ over the parts of $P$. The problem has seen considerable work in approximability, as it…
The paper studies a geometrically robust least-squares problem that extends classical and norm-based robust formulations. Rather than minimizing residual error for fixed or perturbed data, we interpret least-squares as enforcing approximate…
We obtain a full resolution result for minimizers in the exterior isoperimetric problem with respect to a compact obstacle in the large volume regime $v\to\infty$. This is achieved by the study of a Plateau-type problem with free boundary…
We consider the problem of recovering an unknown matching between a set of $n$ randomly placed points in $\mathbb{R}^d$ and random perturbations of these points. This can be seen as a model for particle tracking and more generally, entity…
This paper is concerned with a study of the classical isoperimetric problem modified by an addition of a non-local repulsive term. We characterize existence, non-existence and radial symmetry of the minimizers as a function of mass in the…
This paper studies Minimum Spanning Trees under incomplete information for its vertices. We assume that no information is available on the precise placement of vertices so that it is only known that vertices belong to some neighborhoods…
The classical multi-set split feasibility problem seeks a point in the intersection of finitely many closed convex domain constraints, whose image under a linear mapping also lies in the intersection of finitely many closed convex range…
We consider an isoperimetric problem involving the smallest positive and largest negative curl eigenvalues on abstract ambient manifolds, with a focus on the standard model spaces. We in particular show that the corresponding eigenvalues on…
We study a time minimization problem on the group of motions of a plane with admissible control in a half-disk. The considered control system describes a model of a car that can move forward on a plane and turn in place. Optimal…
The Skorokhod embedding problem aims to represent a given probability measure on the real line as the distribution of Brownian motion stopped at a chosen stopping time. In this paper, we consider an extension of the optimal Skorokhod…
It is a well known phenomenon that many classical minimal surfaces in Euclidean space also exist with higher dihedral symmetry. More precisely, these surfaces are solutions to free boundary problems in a wedge bounded by two vertical planes…
In the theory of minimal submanifold, the following problem is fundamental: when does a given Riemannian manifold admit (or does not admit) a minimal isometric immersion into an Euclidean space form of arbitrary dimension? A partial…
The main goal of this article is to understand the trace properties of nonlocal minimal graphs in~$\R^3$, i.e. nonlocal minimal surfaces with a graphical structure. We establish that at any boundary points at which the trace from inside…
Many clustering problems in computer vision and other contexts are also classification problems, where each cluster shares a meaningful label. Subspace clustering algorithms in particular are often applied to problems that fit this…
Solving the Plateau problem means to find the surface with minimal area among all surfaces with a given boundary. Part of the problem actually consists of giving a suitable definition to the notions of 'surface', 'area' and 'boundary'. The…
We study conformal mappings in the Grushin plane and provide a number of their characterizations in terms of the Sobolev mappings and their geometry. Furthermore, we connect conformality on the Grushin plane with conformality on the complex…
The Bandwidth Problem seeks for a simultaneous permutation of the rows and columns of the adjacency matrix of a graph such that all nonzero entries are as close as possible to the main diagonal. This work focuses on investigating novel…
Set partitioning is a key component of many algorithms in machine learning, signal processing, and communications. In general, the problem of finding a partition that minimizes a given impurity (loss function) is NP-hard. As such, there…
We analyze integer linear programs which we obtain after discretizing two-dimensional subproblems arising from a trust-region algorithm for mixed integer optimal control problems with total variation regularization. We discuss NP-hardness…
The $k$-coverage problem is to find the minimum number of disks such that each point in a given plane is covered by at least $k$ disks. Under unit disk condition, when $k$=1, this problem has been solved by Kershner in 1939. However, when…