A Faster Local Algorithm for Detecting Bounded-Size Cuts with Applications to Higher-Connectivity Problems.
Sebastian ForsterLiu YangPublished in: CoRR (2019)
Keyphrases
- computational complexity
- benchmark problems
- preprocessing
- recognition algorithm
- computational cost
- space complexity
- cost function
- k means
- probabilistic model
- detection algorithm
- optimization algorithm
- expectation maximization
- worst case time complexity
- scales linearly
- fixed size
- times faster
- neural network
- experimental evaluation
- dynamic programming
- significant improvement
- search space
- objective function
- optimization problems
- simulated annealing
- matching algorithm
- memory requirements
- highly efficient
- semidefinite programming
- optimal solution
- space requirements
- iterative algorithms
- similarity measure