A Polylogarithmic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2.
Julia ChuzhoyShi LiPublished in: FOCS (2012)
Keyphrases
- disjoint paths
- detection algorithm
- np hard
- objective function
- computational complexity
- particle swarm optimization
- undirected graph
- k means
- optimization algorithm
- segmentation algorithm
- theoretical analysis
- learning algorithm
- approximation algorithms
- matching algorithm
- edge detection
- computational cost
- cost function
- search space
- worst case
- special case
- closed form
- error bounds
- preprocessing
- weighted graph
- travel time
- optimal solution
- social networks