The One-Inclusion Graph Algorithm is not Always Optimal.
Ishaq Aden-AliYeshwanth CherapanamjeriAbhishek ShettyNikita ZhivotovskiyPublished in: CoRR (2022)
Keyphrases
- dynamic programming
- worst case
- optimal solution
- learning algorithm
- globally optimal
- computational complexity
- cost function
- detection algorithm
- objective function
- k means
- computational cost
- graph clustering
- undirected graph
- graph structure
- tree structure
- optimization algorithm
- probabilistic model
- search space
- expectation maximization
- random walk
- particle swarm optimization
- lower bound
- exhaustive search
- graph model
- search algorithm
- reinforcement learning
- optimal strategy
- optimal parameters
- image segmentation