Packing and covering with balls on Busemann surfaces
Let \(\mathcal{F}\) be a collection of subsets of a domain \(X\). The \textit{set covering problem} asks to find a subcollection of \(\mathcal{F}\) of minimal size whose union is \(X\); similarly, the \textit{set packing problem} asks to find the maximum number of pairwise disjoint subsets of \(\mathcal{F}\). The article under review considers these problems using balls of equal radii of subsets of certain surfaces called Busemann surfaces. A \textit{Busemann space} is a geodesic metric space in which the distance function between any two geodesics is convex, and a \textit{Busemann surface} is a Busemann space which is a \(2\)-dimensional manifold. The main result of the paper is the following: let \(S\) be a compact subset of a Busemann surface and \(\delta\) an arbitrary positive number. Denote by \(\rho_{\delta}(S)\) the minimum number of (closed) balls of radius \(\delta\) in a covering of \(S\), and denote by \(\nu_{\delta}(S)\) the maximum number of (closed) balls in a packing of \(S\). Then \(\rho_{\delta}(S) \leq 19\nu_{\delta}(S)\). Section \(2\) starts by recalling the basic notions and results related to Busemann surfaces, geodesic metric spaces, and coverings of metric spaces by closed and open balls. The section culminates with statements of the main results in the article. Section \(3\) consists of proofs of the results stated in Section \(2\). In the course of proving the main results, multiple auxiliary lemmas are also proven. The fourth and final section is reserved for asking three open questions related to the content of the article.
- Almost optimal set covers in finite VC-dimension
- Approximating hitting sets of axis-parallel rectangles intersecting a monotone curve
- Approximation algorithms for maximum independent set of pseudo-disks
- Computing the geodesic center of a simple polygon
- Covering a hypergraph of subgraphs
- Covering and coloring problems for relatives of intervals
- Covering nearly surface-embedded graphs with a fixed number of balls
- Covering planar graphs with a fixed number of balls
- scientific article; zbMATH DE number 43754 (Why is no real title available?)
- scientific article; zbMATH DE number 1385418 (Why is no real title available?)
- scientific article; zbMATH DE number 1839431 (Why is no real title available?)
- scientific article; zbMATH DE number 2117213 (Why is no real title available?)
- Improved results on geometric hitting set problems
- Independent and hitting sets of rectangles intersecting a diagonal line: algorithms and complexity
- Independent set of intersection graphs of convex objects in 2D
- Isometric embedding of Busemann surfaces into L₁
- Matching, edge-colouring, and dimers.
- Metric entropy and approximation
- Metric spaces, convexity and nonpositive curvature
- Nearest neighbor queries in metric spaces
- On Helly's theorem in geodesic spaces
- Packing and covering a tree by subtrees
- Packing and Covering δ-Hyperbolic Spaces by Balls
- Piercing d-intervals
- Problems from CGCS Luminy, May 2007
- Transversals for families of translates of a two-dimensional convex compact set
- Uniform Central Limit Theorems
- VC-dimension and Erdős-Pósa property
- Über eine kombinatorisch-geometrische Frage von Hadwiger und Debrunner
This page was built for publication: Packing and covering with balls on Busemann surfaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2358828)