Covering planar graphs with a fixed number of balls
From MaRDI portal
Publication:878065
DOI10.1007/S00454-006-1260-0zbMATH Open1115.05070OpenAlexW1998985069MaRDI QIDQ878065FDOQ878065
Bertrand Estellon, Yann Vaxès, Victor Chepoi
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
Cited In (15)
- Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs
- The degree/diameter problem in maximal planar bipartite graphs
- The degree/diameter problem in maximal planar bipartite graphs
- Sample Compression Schemes for Balls in Graphs
- Problems from CGCS Luminy, May 2007
- VC-dimension and Erdős-Pósa property
- A story of diameter, radius, and (almost) Helly property
- Kernelization and approximation of distance-\(r\) independent sets on nowhere dense graphs
- Covering nearly surface-embedded graphs with a fixed number of balls
- Packing and covering with balls on Busemann surfaces
- Approximating maximum diameter-bounded subgraph in unit disk graphs
- Beyond Helly graphs: the diameter problem on absolute retracts
- Diameter, Eccentricities and Distance Oracle Computations on H-Minor Free Graphs and Graphs of Bounded (Distance) Vapnik–Chervonenkis Dimension
- Packing and covering balls in graphs excluding a minor
- On the VC-dimension, covering and separating properties of the cycle and spanning tree hypergraphs of graphs
Recommendations
This page was built for publication: Covering planar graphs with a fixed number of balls
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q878065)
