Average-case complexity of a branch-and-bound algorithm for Min Dominating Set.
Tom DenatArarat HarutyunyanNikolaos MelissinosVangelis Th. PaschosPublished in: Discret. Appl. Math. (2024)
Keyphrases
- branch and bound algorithm
- dominating set
- average case complexity
- lower bound
- upper bound
- facility location problem
- branch and bound
- connected dominating set
- lagrangian relaxation
- average case
- np hard
- lower bounding
- search tree
- facility location
- single machine scheduling problem
- upper bounding
- randomly generated problems
- optimal solution
- precedence constraints
- lower and upper bounds
- objective function
- worst case
- mixed integer linear programming
- max sat
- neural network
- combinatorial optimization
- finding an optimal solution
- orders of magnitude
- tree search