On the lower bound of k-maximal digraphs.
Xiaoxia LinSuohai FanHong-Jian LaiMurong XuPublished in: Discret. Math. (2016)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- objective function
- np hard
- equivalence classes
- directed graph
- lower and upper bounds
- optimal solution
- lower bounding
- worst case
- lagrangian relaxation
- upper and lower bounds
- machine learning
- competitive ratio
- vc dimension
- sample complexity
- hidden markov models
- linear programming relaxation
- database systems
- data sets
- constant factor