A sharp lower bound of index of the cacti with perfect matchings.
Ziwen HuangHanyuan DengShubo ChenPublished in: Ars Comb. (2012)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- objective function
- optimal solution
- np hard
- lower and upper bounds
- database
- lower bounding
- index structure
- linear programming relaxation
- indexing techniques
- lagrangian relaxation
- polynomial approximation
- competitive ratio
- upper and lower bounds
- vc dimension
- worst case
- data structure
- information retrieval
- data sets