{"paper":{"title":"Fast algorithms for min independent dominating set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.DS","authors_text":"Bruno Escoffier, Nicolas Bourgeois, Vangelis Th. Paschos","submitted_at":"2009-05-13T12:50:52Z","abstract_excerpt":"We first devise a branching algorithm that computes a minimum independent dominating set on any graph with running time O*(2^0.424n) and polynomial space. This improves the O*(2^0.441n) result by (S. Gaspers and M. Liedloff, A branch-and-reduce algorithm for finding a minimum independent dominating set in graphs, Proc. WG'06). We then show that, for every r>3, it is possible to compute an r-((r-1)/r)log_2(r)-approximate solution for min independent dominating set within time O*(2^(nlog_2(r)/r))."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0905.1993","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}