The One-Inclusion Graph Algorithm is not Always Optimal.
Ishaq Aden-AliYeshwanth CherapanamjeriAbhishek ShettyNikita ZhivotovskiyPublished in: COLT (2023)
Keyphrases
- dynamic programming
- learning algorithm
- worst case
- graph based algorithm
- objective function
- segmentation algorithm
- globally optimal
- maximum flow
- detection algorithm
- computational cost
- cost function
- np hard
- probabilistic model
- significant improvement
- optimization algorithm
- preprocessing
- tree structure
- computational complexity
- graph structure
- solution path
- dominating set
- minimum spanning tree
- shortest path problem
- finding the shortest path
- graph partitioning
- graph model
- exhaustive search
- convergence rate
- matching algorithm
- k means
- optimal solution
- bayesian networks