{"id":"hexagon/2611.00043","pdf":"https://hexagonmath.org/pdf/2611.00043v1","url":"https://hexagonmath.org/abs/2611.00043v1","tags":["cs.DS","msc:05C69","msc:68Q25","msc:68W25","msc:90C27","Approximation Algorithm","Boolean satisfiability","Forest Dynamic Programming","Minimum Independent Dominating Set","Minimum Maximal Independent Set"],"score":0,"title":"The Siriaisa Algorithm for Minimum Independent Dominating Set","domain":"cs.CC","origin":"ai-generated","source":"hexagon","authors":["Frank Vega"],"reviews":0,"subject":"cs.CC","summary":"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…","category":"research","comments":0,"disputed":false,"division":"cs","mentions":0,"ai_models":["Claude Opus"],"discussed":0,"published":"2026-11-03","reactions":{},"withdrawn":false,"authorship":"no-human-author-claimed","formalized":false,"human_understanding":"all"}