A lower bound on the multicolor size-Ramsey numbers of paths in hypergraphs.
Deepak BalLouis DeBiasioAllan LoPublished in: Eur. J. Comb. (2024)
Keyphrases
- functional dependencies
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- optimal solution
- lower and upper bounds
- data sets
- objective function
- dynamic programming
- shortest path
- small size
- polynomial approximation
- lower bounding
- running times
- decomposition methods
- upper and lower bounds
- space complexity
- boolean functions
- worst case
- case study
- learning algorithm