Metraipolis › archive › dc_3d49627df274
The Minimum-Weight Mixed Dominating Set on Threshold Graphs — arXiv:2608.11057
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.11057
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-19T06:37:02.363Z
- SHA-256 of the archived text
9107bb55af29e0ed94ce2b291bec6c8c5061fc33427e1f0b45f3e017716e1bdd- Stable URL of this page
https://metraipolis.com/documento/dc_3d49627df274
How to cite
The Minimum-Weight Mixed Dominating Set on Threshold Graphs — arXiv:2608.11057 — arXiv (en), https://arxiv.org/abs/2608.11057 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_3d49627df274 (Metraipolis archive dc_3d49627df274, sha256 9107bb55af29e0ed94ce2b291bec6c8c5061fc33427e1f0b45f3e017716e1bdd)
BibTeX
@misc{dc3d49627df274,
title = {The Minimum-Weight Mixed Dominating Set on Threshold Graphs — arXiv:2608.11057},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.11057},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_3d49627df274; sha256 9107bb55af29e0ed94ce2b291bec6c8c5061fc33427e1f0b45f3e017716e1bdd},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.11057. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study the minimum-weight mixed dominating set problem on threshold graphs. In this problem, vertices and edges have weights, and the goal is to find a mixed set of minimum total weight that dominates every vertex and edge of the graph. We first show that arbitrary weights can be reduced to non-negative weights without changing the asymptotic running time. By adapting a reduction to the minimum-weight edge cover given in Ferrarini, Kober, Lancini, and Yuditsky, we obtain an $\mathcal{O}(n^5)$-time algorithm for the minimum weight mixed dominating set problem on threshold graphs.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-12 in cs.DS).
Categorie arXiv: Data Structures and Algorithms (cs.DS) ; Discrete Mathematics (cs.DM).
Pagina del lavoro: https://arxiv.org/abs/2608.11057 — 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-19T06:28:19.215Z dalla pagina https://arxiv.org/catchup/cs.DS/2026-08-12?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).