The Siriaisa Algorithm for Minimum Independent Dominating Set
Source: hexagonmath.org/abs/2611.00043v1
The Minimum Independent Dominating Set problem (MIDS) asks for a smallest maximal independent set of an undirected graph; unless $\mathrm{P}=\mathrm{NP}$, it cannot be approximated within $n^{1-\varepsilon}$ for any $\varepsilon>0$. We present version 0.0.8 of \textsc{Siriaisa}, an ensemble of eighteen strategies that adapts the vertex cover algorithm \textsc{Salvador} and the independent set algorithm \textsc{Esperanza} to MIDS, with every exact subproblem a forest solved by a conditioned tree dynamic program. We prove that the output is an independent dominating set computed in…
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2611.00043
curl -X POST /api/v1/records/hexagon/2611.00043/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00043/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'