Kernelization and Lower Bounds of the Signed Domination Problem.
Ying ZhengJianxin WangQilong FengPublished in: FAW-AAIM (2013)
Keyphrases
- learning algorithm
- lower bound
- upper bound
- online algorithms
- objective function
- branch and bound algorithm
- np hard
- stochastic gradient descent
- branch and bound
- optimal solution
- upper and lower bounds
- worst case
- lower bounding
- vc dimension
- lower and upper bounds
- sample complexity
- linear programming relaxation
- quadratic assignment problem
- running times
- special case
- optimal cost
- linear programming
- randomly generated problems