An Improved Approximation Algorithm for Minimum Size 2-Edge Connected Spanning Subgraphs.
Joseph CheriyanAndrás SeböZoltán SzigetiPublished in: IPCO (1998)
Keyphrases
- theoretical analysis
- learning algorithm
- detection algorithm
- computational complexity
- tree structure
- np hard
- optimization algorithm
- expectation maximization
- times faster
- dynamic programming
- computational cost
- segmentation algorithm
- convergence rate
- closed form
- linear programming
- recognition algorithm
- square error
- probabilistic model
- cost function
- k means
- preprocessing
- data structure
- similarity measure
- worst case
- significant improvement
- memory requirements
- optimal solution
- fixed size