Related papers: Covering compact metric spaces greedily
We give a general procedure for constructing metric spaces from systems of partitions. This generalises and provides analogues of Sageev's construction of dual CAT(0) cube complexes for the settings of hyperbolic and injective metric…
We propose and analyze a weighted greedy scheme for computing deterministic sample configurations in multidimensional space for performing least-squares polynomial approximations on $L^2$ spaces weighted by a probability density function.…
We develop greedy algorithms to approximate the optimal solution to the multi-fidelity sensor selection problem, which is a cost constrained optimization problem prescribing the placement and number of cheap (low signal-to-noise) and…
The greedy spanner is a high-quality spanner: its total weight, edge count and maximal degree are asymptotically optimal and in practice significantly better than for any other spanner with reasonable construction time. Unfortunately, all…
In the present paper, we consider the family of all compact Alexandrov spaces with curvature bound below having a definite upper diameter bound of a fixed dimension. We introduce the notion of essential coverings by contractible metric…
In any attempt at designing an efficient algorithm for the minimum vertex cover problem, obtaining good upper and lower bounds for the vertex cover number could be crucial. In this article we present a modified greedy algorithm of…
This article presents a novel mathematical formalism for advanced manifold--metric pairs, enhancing the frameworks of geometry and topology. We construct various D-dimensional manifolds and their associated metric spaces using functional…
Many concrete problems are formulated in terms of a finite set of points in $R^n$ which, via the ambient Euclidean metric, becomes a finite metric space. To obtain information from such a space, it is often useful to associate a graph to…
Projective geometry provides the preferred framework for most implementations of Euclidean space in graphics applications. Translations and rotations are both linear transformations in projective geometry, which helps when it comes to…
Given a compact pseudo-metric space, we associate to it upper and lower dimensions, depending only on the metric. Then we construct a doubling metric for which the measure of a dillated ball is closely related to these dimensions.
Confidence sets from i.i.d. data are constructed for the extrinsic mean of a probabilty measure P on spheres, real projective spaces, and complex projective spaces, as well as Grassmann manifolds, with the latter three embedded by the…
Cover time, in the context of dynamical systems, quantifies the rate at which orbits cover the system. We prove that for countable full shifts with a Gibbs measure, equipped with a natural metric, the rate of covering of orbits of points…
Consider the puzzle: given a number, remove $k$ digits such that the resulting number is as large as possible. Various techniques were employed to derive a linear-time solution to the puzzle: predicate logic was used to justify the…
A rectifier network is a directed acyclic graph with distinguished sources and sinks; it is said to compute a Boolean matrix $M$ that has a $1$ in the entry $(i,j)$ iff there is a path from the $j$th source to the $i$th sink. The smallest…
We investigate the performance of a deterministic GREEDY algorithm for the problem of maximizing functions under a partition matroid constraint. We consider non-monotone submodular functions and monotone subadditive functions. Even though…
With a simple generic approach, we develop a classification that encodes and measures the strength of completeness (or compactness) properties in various types of spaces and ordered structures. The approach also allows us to encode notions…
We show that in doubling, geodesic metric measure spaces (including, for example, Euclidean space), sets of positive measure have a certain large-scale metric density property. As an application, we prove that a set of positive measure in…
The general problem addressed in this work is the development of a systematic study of the thresholding greedy algorithm for general biorthogonal systems (also known as Markushevich bases) in quasi-Banach spaces from a functional-analytic…
A number of recent results in Euclidean Harmonic Analysis have exploited several adjacent systems of dyadic cubes, instead of just one fixed system. In this paper, we extend such constructions to general spaces of homogeneous type, making…
We introduce a parameterized version of set cover that generalizes several previously studied problems. Given a ground set V and a collection of subsets S_i of V, a feasible solution is a partition of V such that each subset of the…