A Polynomial Algorithm for the k-cut Problem for Fixed k.
Olivier GoldschmidtDorit S. HochbaumPublished in: Math. Oper. Res. (1994)
Keyphrases
- cost function
- optimal solution
- times faster
- learning algorithm
- computationally efficient
- polynomially bounded
- recognition algorithm
- detection algorithm
- experimental evaluation
- np hard
- preprocessing
- similarity measure
- data sets
- estimation algorithm
- particle swarm optimization
- expectation maximization
- optimization algorithm
- improved algorithm
- computational complexity
- tree structure
- fixed size
- selection algorithm
- matching algorithm
- dynamic programming
- linear programming
- high accuracy
- worst case