arXiv (All)
open access
Near-Optimal Distributed Domination in Planar Graphs
We give a deterministic $(8+\varepsilon)$-approximation for minimum dominating set on planar graphs in a constant number of rounds of the LOCAL model, for every $\varepsilon>0$. This improves the previous ratio $11+\varepsilon$ obtained by Heydt et al. The ratio is near-optimal in this model: its le
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Local large deviations for triangles in sparse random graphs#1036279
- A combinatorial approach to point-flat incidences over finite fields#1118077
- Improved upper bounds on the list chromatic number of $K_t$-minor-free graphs#1157217
- On the large-clique version of the Erdős-Sós conjecture#1077594
- On harmonic centers of graphs#1105853
Record · ID 1117067
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive