A polynomial-time algorithm for planar multicuts with few source-sink pairs
Cédric BentzPublished in: CoRR (2012)
Keyphrases
- learning algorithm
- preprocessing
- matching algorithm
- experimental evaluation
- k means
- cost function
- worst case
- objective function
- search space
- theoretical analysis
- expectation maximization
- input data
- computational cost
- times faster
- detection algorithm
- optimization algorithm
- high accuracy
- probabilistic model
- genetic algorithm
- np hard
- dynamic programming
- significant improvement
- clustering method
- pairwise
- optimal solution
- convergence rate
- polynomial time complexity