Related papers: Covering compact metric spaces greedily

There were obtained some properties of weakly m-convex sets. Various kinds of the problem of shadow were investigated. There was obtained the lower estimation for the number of balls that are necessary to create a shadow at the point of the…

We study minimum entropy submodular optimization, a common generalization of the minimum entropy set cover problem, studied earlier by Cardinal et al., and the submodular set cover problem. We give a general bound of the approximation…

We describe a method for constructing $n$-orthogonal coordinate systems in constant curvature spaces. The construction proposed is a modification of Krichever's method for producing orthogonal curvilinear coordinate systems in the…

Many algorithms require discriminative boundaries, such as separating hyperplanes or hyperballs, or are specifically designed to work on spherical data. By applying inversive geometry, we show that the two discriminative boundaries can be…

I provide a novel approach to characterizing the set of interim realizable allocations, in the spirit of Matthews (1984) and Border (1991). The approach allows me to identify precisely why exact characterizations are difficult to obtain in…

How should you choose a good set of (say) 48 planes in four dimensions? More generally, how do you find packings in Grassmannian spaces? In this article I give a brief introduction to the work that I have been doing on this problem in…

This paper addresses the question: how should N n-dimensional subspaces of m-dimensional Euclidean space be arranged so that they are as far apart as possible? The results of extensive computations for modest values of N, n, m are…

The problem of optimally placing sensors under a cost constraint arises naturally in the design of industrial and commercial products, as well as in scientific experiments. We consider a relaxation of the full optimization formulation of…

We present a general framework for compressing unstructured scientific data with known local connectivity. A common application is simulation data defined on arbitrary finite element meshes. The framework employs a greedy topology…

In this paper, we characterize round spheres in the Euclidean space under some suitable conditions on the r-mean curvature.

We consider geodesically convex optimization problems involving distances to a finite set of points $A$ in a CAT(0) cubical complex. Examples include the minimum enclosing ball problem, the weighted mean and median problems, and the…

In this article, we study the (d-1)-volume and the covering numbers of the medial axis of a compact set of the Euclidean d-space. In general, this volume is infinite; however, the (d-1)-volume and covering numbers of a filtered medial axis…

In discrete geometry, the contact number of a given finite number of non-overlapping spheres was introduced as a generalization of Newton's kissing number. This notion has not only led to interesting mathematics, but has also found…

We show that complex (scale-free) network topologies naturally emerge from hyperbolic metric spaces. Hyperbolic geometry facilitates maximally efficient greedy forwarding in these networks. Greedy forwarding is topology-oblivious.…

We study adaptive greedy algorithms for the problems of stochastic set cover with perfect and imperfect coverages. In stochastic set cover with perfect coverage, we are given a set of items and a ground set B. Evaluating an item reveals its…

Working on doubling metric spaces, we construct generalised dyadic cubes adapting ultrametric structure. If the space is complete, then the existence of such cubes and the mass distribution principle lead into a simple proof for the…

We give a short proof of the contractibility of the space of geodesic triangulations with fixed combinatorial type of a convex polygon in the Euclidean plane. Moreover, for any $n>0$, we show that there exists a space of geodesic…

A sensor has the ability to probe its surroundings. However, uncertainties in its exact location can significantly compromise its sensing performance. The radius of robust feasibility defines the maximum range within which robust…

We construct the differential geometry of smooth manifolds equipped with an algebraic curvature map acting as an area measure. Area metric geometry provides a spacetime structure suitable for the discussion of gauge theories and strings,…

The problem of column subset selection has recently attracted a large body of research, with feature selection serving as one obvious and important application. Among the techniques that have been applied to solve this problem, the greedy…