Related papers: On minimizers of the maximal distance functional f…

In this work, we study the metric Steiner Tree problem on graphs focusing on computing lower bounds for the integrality gap of the bi-directed cut (BCR) formulation and introducing a novel formulation, the Complete Metric (CM) model,…

Uniform cost-distance Steiner trees minimize the sum of the total length and weighted path lengths from a dedicated root to the other terminals. They are applied when the tree is intended for signal transmission, e.g. in chip design or…

We consider the problem of minimizing the composition of a nonsmooth function with a smooth mapping in the case where the proximity operator of the nonsmooth function can be explicitly computed. We first show that this proximity operator…

This paper provides a set of sensitivity analysis and activity identification results for a class of convex functions with a strong geometric structure, that we coined "mirror-stratifiable". These functions are such that there is a…

We consider the minimization problem for an integral functional $J$, possibly non-convex and non-coercive in $W^{1,1}_0(\Omega)$, where $\Omega\subset\R^n$ is a bounded smooth set. We prove sufficient conditions in order to guarantee that a…

We propose here a proof of existence of a minimizer of a segmentation functional based on a priori information on target shapes, and formulated with level sets. The existence of a minimizer is very important, because it guarantees the…

We introduce a notion of connected perimeter for planar sets defined as the lower semi-continuous envelope of perimeters of approximating sets which are measure-theoretically connected. A companion notion of simply connected perimeter is…

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…

In this article, we study the Euclidean minimum spanning tree problem in an imprecise setup. The problem is known as the \emph{Minimum Spanning Tree Problem with Neighborhoods} in the literature. We study the problem where the neighborhoods…

We study the problem of finding curves of minimum pointwise-maximum arc-length derivative of curvature, here simply called curves of minimax spirality, among planar curves of fixed length with prescribed endpoints and tangents at the…

We provide an upper and lower bound for the length of Maximum Distance Problem minimizers in terms of a finite scale geometric square sum.

This paper studies lower bounds for fundamental optimization problems in the CONGEST model. We show that solving problems exactly in this model can be a hard task, by providing $\tilde{\Omega}(n^2)$ lower bounds for cornerstone problems,…

We consider temporal graphs with discrete time labels and investigate the size and the approximability of minimum temporally connected spanning subgraphs. We present a family of minimally connected temporal graphs with $n$ vertices and…

In this work, we present an $\Omega\left(\min\{\log \Delta, \sqrt{\log n}\}\right)$ lower bound for Maximal Matching (MM) in $\Delta$-ary trees against randomized algorithms. By a folklore reduction, the same lower bound applies to Maximal…

We study the boundedness problem for maximal operators $\mathbb{M}_{\sigma}$ associated to flat plane curves with Mitigating factors, defined by $$\mathbb{M}_{\sigma}f(x) \, := \, \sup_{1 \leq t \leq 2} \left|\int_{0}^{1} f(x-t\Gamma(s)) \,…

We prove a local minimizing property for strictly stable free-boundary minimal hypersurfaces in the relative current setting. Let $\Sigma^n$ be a compact, two-sided, properly embedded free-boundary minimal hypersurface in a compact…

The closed string field theory minimal-area problem asks for the conformal metric of least area on a Riemann surface with the condition that all non-contractible closed curves have length at least 2\pi. This is an extremal length problem in…

This paper studies minimax optimization problems $\min_x \max_y f(x,y)$, where $f(x,y)$ is $m_x$-strongly convex with respect to $x$, $m_y$-strongly concave with respect to $y$ and $(L_x,L_{xy},L_y)$-smooth. Zhang et al. provided the…

For a given family of smooth closed curves $\gamma^1,...,\gamma^\alpha\subset\mathbb{R}^3$ we consider the problem of finding an elastic \emph{connected} compact surface $M$ with boundary $\gamma=\gamma^1\cup...\cup\gamma^\alpha$. This is…

We study the min-max optimization problem where each function contributing to the max operation is strongly-convex and smooth with bounded gradient in the search domain. By smoothing the max operator, we show the ability to achieve an…