A set-cover based method automatically generates provably (locally) optimal branching rules for the maximum independent set problem, improving empirical average branching factors on 3-regular graphs.
An $O^*(1.0821^n)$-Time Algorithm for Computing Maximum Independent Set in Graphs with Bounded Degree 3
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
We give an $O^*(1.0821^n)$-time, polynomial space algorithm for computing Maximum Independent Set in graphs with bounded degree 3. This improves all the previous running time bounds known for the problem.
citation-role summary
background 1
citation-polarity summary
fields
math.OC 1years
2024 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem
A set-cover based method automatically generates provably (locally) optimal branching rules for the maximum independent set problem, improving empirical average branching factors on 3-regular graphs.