Covering planar graphs with a fixed number of balls

DOI10.1007/s00454-006-1260-0zbMath1115.05070OpenAlexW1998985069MaRDI QIDQ878065

Bertrand Estellon, Victor Chepoi, Yann Vaxès

Publication date: 26 April 2007

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-006-1260-0

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (15)

Packing and covering with balls on Busemann surfaces ⋮ Diameter, Eccentricities and Distance Oracle Computations on H-Minor Free Graphs and Graphs of Bounded (Distance) Vapnik–Chervonenkis Dimension ⋮ Kernelization and approximation of distance-\(r\) independent sets on nowhere dense graphs ⋮ Approximating maximum diameter-bounded subgraph in unit disk graphs ⋮ Beyond Helly graphs: the diameter problem on absolute retracts ⋮ Sample Compression Schemes for Balls in Graphs ⋮ A story of diameter, radius, and (almost) Helly property ⋮ The degree/diameter problem in maximal planar bipartite graphs ⋮ Problems from CGCS Luminy, May 2007 ⋮ On the VC-dimension, covering and separating properties of the cycle and spanning tree hypergraphs of graphs ⋮ The degree/diameter problem in maximal planar bipartite graphs ⋮ VC-dimension and Erdős-Pósa property ⋮ Packing and covering balls in graphs excluding a minor ⋮ Covering nearly surface-embedded graphs with a fixed number of balls ⋮ Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs

This page was built for publication: Covering planar graphs with a fixed number of balls