Optimal node disjoint paths on partial 2-trees: A linear algorithm and polyhedral results.
François MargotAlain ProdonThomas M. LieblingPublished in: Math. Methods Oper. Res. (1995)
Keyphrases
- dynamic programming
- optimal solution
- tree structure
- learning algorithm
- computational complexity
- convex hull
- worst case
- segmentation algorithm
- optimal path
- search space
- np hard
- detection algorithm
- piecewise linear
- closed form
- preprocessing
- minimum error
- cost function
- k means
- convergence rate
- exhaustive search
- error tolerance
- linear complexity
- disjoint paths
- graph structure
- random variables
- expectation maximization
- simulated annealing
- objective function