A Polylogarithmic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2.
Julia ChuzhoyShi LiPublished in: J. ACM (2016)
Keyphrases
- learning algorithm
- disjoint paths
- preprocessing
- error bounds
- detection algorithm
- np hard
- expectation maximization
- matching algorithm
- computational complexity
- optimization algorithm
- cost function
- probabilistic model
- dynamic programming
- tree structure
- computational cost
- k means
- search space
- edge detection algorithm
- similarity measure
- undirected graph
- neural network
- graph structure
- approximation ratio
- end to end
- closed form
- segmentation algorithm
- simulated annealing
- special case
- data structure
- objective function