Lower Bounds for the Domination Numbers of Connected Graphs without Short Cycles.
Yinglei SongPublished in: CoRR (2015)
Keyphrases
- lower bound
- connected graphs
- upper bound
- branch and bound algorithm
- lower and upper bounds
- np hard
- branch and bound
- objective function
- vc dimension
- upper and lower bounds
- worst case
- lagrangian relaxation
- randomly generated problems
- real time
- pairwise
- optimal solution
- quadratic assignment problem
- lower bounding
- set of randomly generated instances