Metraipolis › archive › dc_1fabff0ea803

Connected Dominating Set on Semi-Ladder-Free Graphs — arXiv:2609.39666

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.39666
License (as archived)
CC0-1.0
Archived
2026-10-07T15:17:12.724Z
SHA-256 of the archived text
9608b9ee5bc057f312fb2b94864df8cb4226dddf3afeea03c98086e107889077
Stable URL of this page
https://metraipolis.com/documento/dc_1fabff0ea803

How to cite

Connected Dominating Set on Semi-Ladder-Free Graphs — arXiv:2609.39666 — arXiv (en), https://arxiv.org/abs/2609.39666 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_1fabff0ea803 (Metraipolis archive dc_1fabff0ea803, sha256 9608b9ee5bc057f312fb2b94864df8cb4226dddf3afeea03c98086e107889077)
BibTeX
@misc{dc1fabff0ea803,
  title = {Connected Dominating Set on Semi-Ladder-Free Graphs — arXiv:2609.39666},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.39666},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_1fabff0ea803; sha256 9608b9ee5bc057f312fb2b94864df8cb4226dddf3afeea03c98086e107889077},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.39666. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We study \textsc{Connected Dominating Set} on graphs whose closed-neighborhood set systems are $d$-semi-ladder-free. This structural condition strictly generalizes the biclique-free setting and provides a natural regime for connectivity-constrained domination. We obtain both a fixed-parameter algorithm and an approximate kernelization framework for the problem on this class. Our algorithmic result is based on a new compact representation theorem for inclusion-wise minimal set covers in $d$-semi-ladder-free set systems. Although the number of minimal set covers of size at most $k$ may be as large as $n^{\Omega(k)}$, we show that all such set covers can nevertheless be encoded by a family of at most $k^{kd+1}$ tuples, and that this family can be enumerated in time $\Oh(k^{kd+2}\cdot nm)$. Combining this representation with a \textsc{Group Steiner Tree} subroutine, we obtain an algorithm for \textsc{Connected Set Cover}, which in turn yields an algorithm for \textsc{Connected Dominating Set} running in time $k^{kd+2}\cdot 2^k \cdot n^{\Oh(1)}$ and polynomial space. For the preprocessing result, we introduce grouped domination cores and dominator cores, and prove polynomial upper bounds on their sizes in $d$-semi-ladder-free graphs. Using these structures, we obtain, for every fixed $d$ and $\varepsilon>0$, a polynomial-time $(1+\varepsilon)$-lossy compression for \textsc{Connected Dominating Set} to an equivalent reduced instance of size $k^{\Oh(d^2/\varepsilon)}$. The reduced instance is a \textsc{Connected Dominating Set} instance on a $(d+2)$-semi-ladder-free graph.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-01 in cs.DS).
Categorie arXiv: Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2609.39666 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T14:50:37.652Z dalla pagina https://arxiv.org/catchup/cs.DS/2026-10-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).