相关论文: The Paulsen Problem Made Simple

We provide a simple proof of the existence of a planar separator by showing that it is an easy consequence of the circle packing theorem. We also reprove other results on separators, including: (A) There is a simple cycle separator if the…

In this work, we study the socially fair $k$-median/$k$-means problem. We are given a set of points $P$ in a metric space $\mathcal{X}$ with a distance function $d(.,.)$. There are $\ell$ groups: $P_1,\dotsc,P_{\ell} \subseteq P$. We are…

Makespan minimization on unrelated machines is a classic problem in approximation algorithms. No polynomial time $(2-\delta)$-approximation algorithm is known for the problem for constant $\delta> 0$. This is true even for certain special…

We consider the problem of computing the (two-sided) Hausdorff distance between the unit $\ell_{p_{1}}$ and $\ell_{p_{2}}$ norm balls in finite dimensional Euclidean space for $1 \leq p_1 < p_2 \leq \infty$, and derive a closed-form formula…

We propose a quasi-Newton-type method for nonconvex optimization with Lipschitz continuous gradients and Hessians. The algorithm finds an $\varepsilon$-stationary point within $\tilde{\mathrm{O}}(d^{1/4} \varepsilon^{-13/8})$ gradient…

We consider the following problem about dispersing points. Given a set of points in the plane, the task is to identify whether by moving a small number of points by small distance, we can obtain an arrangement of points such that no pair of…

The input to the NP-hard Point Line Cover problem (PLC) consists of a set $P$ of $n$ points on the plane and a positive integer $k$, and the question is whether there exists a set of at most $k$ lines which pass through all points in $P$. A…

Variational regularization and the quasisolutions method are justified for unbounded closed, possibly nonlinear, operators. The argument is quite simple and yields general results.

We study the problem of finding a mapping $f$ from a set of points into the real line, under ordinal triple constraints. An ordinal constraint for a triple of points $(u,v,w)$ asserts that $|f(u)-f(v)|<|f(u)-f(w)|$. We present an…

We study approximation properties of sequences of centered random elements $X_d$, $d\in\mathbb{N}$, with values in separable Hilbert spaces. We focus on sequences of tensor product-type random elements, which have covariance operators of…

We consider the $(\ell_p,\ell_r)$-Grothendieck problem, which seeks to maximize the bilinear form $y^T A x$ for an input matrix $A$ over vectors $x,y$ with $\|x\|_p=\|y\|_r=1$. The problem is equivalent to computing the $p \to r^*$ operator…

We establish an epsilon-regularity theorem at points in the free boundary of almost-minimizers of the energy $\mathrm{Per}_{w}(E)=\int_{\partial^*E}w\,\mathrm{d} {\mathscr{H}}^{n-1}$, where $w$ is a weight asymptotic to…

In the Rectangle Stabbing problem, input is a set ${\cal R}$ of axis-parallel rectangles and a set ${\cal L}$ of axis parallel lines in the plane. The task is to find a minimum size set ${\cal L}^* \subseteq {\cal L}$ such that for every…

We study boundedness and compactness of composition operators on weighted Bergman spaces of Dirichlet series. Particularly, we obtain in some specific cases, upper and lower bounds of the essential norm of these operators and a criterion of…

We solve the Kato square root problem for divergence form operators on complete Riemannian manifolds that are embedded in Euclidean space with a bounded second fundamental form. We do this by proving local quadratic estimates for…

For a triangle $\Delta$, let (P) denote the problem of the existence of points in the plane of $\Delta$, that are at rational distance to the 3 vertices of $\Delta$. Answer to (P) is known to be positive in the following situation: $\Delta$…

Entropic regularization is quickly emerging as a new standard in optimal transport (OT). It enables to cast the OT computation as a differentiable and unconstrained convex optimization problem, which can be efficiently solved using the…

In the article we propose a general scheme for solutions of some approximation problems under a rather general setting. We illustrate the application of the proposed scheme by a series of examples, in particular we show that many results in…

We present an algorithm of finding numerical solutions of pulsar equation. The problem of finding the solutions was reduced to finding expansion coefficients of the source term of the equation in a base of orthogo- nal functions defined on…

The all-pairs shortest distances (APSD) with differential privacy (DP) problem takes as input an undirected, weighted graph $G = (V,E, \mathbf{w})$ and outputs a private estimate of the shortest distances in $G$ between all pairs of…