Nearly optimal independence oracle algorithms for edge estimation in hypergraphs.
Holger DellJohn LapinskasKitty MeeksPublished in: CoRR (2022)
Keyphrases
- computational complexity
- graph theory
- worst case
- database
- exhaustive search
- significant improvement
- orders of magnitude
- computational cost
- machine learning
- optimal solution
- decomposition methods
- benchmark datasets
- computationally efficient
- data mining techniques
- optimization problems
- state space
- dynamic programming
- pairwise
- feature selection
- social networks