A nearly linear time algorithm for the half integral disjoint paths packing.
Ken-ichi KawarabayashiBruce A. ReedPublished in: SODA (2008)
Keyphrases
- learning algorithm
- times faster
- np hard
- worst case
- preprocessing
- theoretical analysis
- computational complexity
- search space
- optimal solution
- optimization algorithm
- experimental evaluation
- probabilistic model
- high accuracy
- expectation maximization
- computationally efficient
- detection algorithm
- total error rate
- disjoint paths
- neural network
- suffix array
- packing problem
- weighted graph
- recognition algorithm
- input data
- objective function