Average-case complexity of a branch-and-bound algorithm for min dominating set.
Tom DenatArarat HarutyunyanVangelis Th. PaschosPublished in: CoRR (2019)
Keyphrases
- branch and bound algorithm
- dominating set
- average case complexity
- lower bound
- facility location problem
- upper bound
- branch and bound
- average case
- lower bounding
- connected dominating set
- np hard
- precedence constraints
- search tree
- worst case
- approximation algorithms
- objective function
- lagrangian relaxation
- randomly generated problems
- upper bounding
- lower and upper bounds
- mixed integer linear programming
- single machine scheduling problem
- optimal solution
- max sat
- search algorithm
- facility location
- cost function
- combinatorial optimization