Related papers: Approximation schemes satisfying Shapiro's Theorem

Given a set of points in the plane, the \textsc{General Position Subset Selection} problem is that of finding a maximum-size subset of points in general position, i.e., with no three points collinear. The problem is known to be ${\rm…

We construct a Banach space satisfying that the nearest point map (also called proximity mapping or metric projection) onto any compact and convex subset is continuous but not uniformly continuous. The space we construct is locally…

An $\epsilon$-approximate incidence between a point and some geometric object (line, circle, plane, sphere) occurs when the point and the object lie at distance at most $\epsilon$ from each other. Given a set of points and a set of objects,…

Let $\mathfrak{A}$ be a Banach algebra, and $\mathcal{X}$ a Banach $\mathfrak{A}$-bimodule. A bounded linear mapping $\mathcal{D}:\mathfrak{A}\rightarrow \mathcal{X}$ is approximately semi-inner derivation if there eixist nets…

The paper presents complexity results and performance guaranties for a family of approximation algorithms for an optimisation problem arising in software testing and manufacturing. The problem is formulated as a partitioning of a set where…

New concepts related to approximating a Lipschitz function between Banach spaces by affine functions are introduced. Results which clarify when such approximations are possible are proved and in some cases a complete characterization of the…

We give sufficient conditions for a group of homeomorphisms of a Peano continuum X without cut-points to be a convergence group. The condition is that there is a collection of convergence subgroups whose limit sets `cut up' X in the correct…

Let X be an analytic set defined by polynomials whose coefficients a_1,...,a_s are holomorphic functions. We formulate conditions such that for all sequences {a_(1,n)},...,{a_(s,n)} of holomorphic functions converging locally uniformly to…

Stochastic Approximation (SA) was introduced in the early 1950's and has been an active area of research for several decades. While the initial focus was on statistical questions, it was seen to have applications to signal processing,…

Stochastic approximation algorithms are iterative procedures which are used to approximate a target value in an environment where the target is unknown and direct observations are corrupted by noise. These algorithms are useful, for…

Following the success of the so-called algebraic approach to the study of decision constraint satisfaction problems (CSPs), exact optimization of valued CSPs, and most recently promise CSPs, we propose an algebraic framework for valued…

Let $(x_n)$ be a sequence in a Banach space $X$ which does not converge in norm, and let $E$ be an isomorphically precisely norming set for $X$ such that \[ \sum_n |x^*(x_{n+1}-x_n)|< \infty, \; \forall x^* \in E. \qquad (*) \] Then there…

We present a form convergence theorem for sequences of sectorial forms and their associated semigroups in a complex Hilbert space. Roughly speaking, the approximating forms $a_n$ are all `bounded below' by the limiting form $a$, but in…

We study the approximability of two related problems on graphs with $n$ nodes and $m$ edges: $n$-Pairs Shortest Paths ($n$-PSP), where the goal is to find a shortest path between $O(n)$ prespecified pairs, and All Node Shortest Cycles…

We give approximation schemes for Subset TSP and Steiner Tree on unit disk graphs, and more generally, on intersection graphs of similarly sized connected fat (not necessarily convex) polygons in the plane. As a first step towards this…

Column-sparse packing problems arise in several contexts in both deterministic and stochastic discrete optimization. We present two unifying ideas, (non-uniform) attenuation and multiple-chance algorithms, to obtain improved approximation…

The paper proposes, an algorithm to produce novel m-point (for any integer m>=2) binary non-stationary subdivision scheme. It has been developed using uniform trigonometric B-spline basis functions and smoothness is being analyzed using the…

Let X and Y be two infinite-dimensional Banach spaces. If X is crudely finitely representable in every finite-codimensional subspace of Y, then any proper subset of X almost bi-Lipschitz embeds into Y, in a sense quite close to that of F.…

Raghavendra (STOC 2008) gave an elegant and surprising result: if Khot's Unique Games Conjecture (STOC 2002) is true, then for every constraint satisfaction problem (CSP), the best approximation ratio is attained by a certain simple…

Let $\mathscr{B}(X)$ denote the Banach algebra of bounded operators on $X$, where~$X$ is either Tsirelson's Banach space or the Schreier space of order $n$ for some $n\in\mathbb N$. We show that the lattice of closed ideals…