Login / Signup
Average-case complexity of a branch-and-bound algorithm for maximum independent set, under the $\mathcal{G}(n, p)$ random model.
Nicolas Bourgeois
R. Catellier
Tom Denat
Vangelis Th. Paschos
Published in:
CoRR (2015)
Keyphrases
</>
branch and bound algorithm
lower bound
neural network
theoretical analysis
optimal solution
cost function
np hard
precedence constraints
single machine scheduling problem