Improved lower bounds for Queen's Domination via an exactly-solvable relaxation.
Archit KarandikarAkashnil DuttaPublished in: CoRR (2023)
Keyphrases
- lower bound
- np hard
- upper bound
- linear programming relaxation
- special case
- objective function
- lagrangian relaxation
- branch and bound
- branch and bound algorithm
- np complete
- data sets
- vc dimension
- evolutionary algorithm
- search space
- integer programming
- optimal solution
- database
- integrality gap
- computational complexity
- improved algorithm
- data structure
- randomly generated problems