A Polynomial-Time Algorithm for Planar Multicuts with Few Source-Sink Pairs.
Cédric BentzPublished in: IPEC (2012)
Keyphrases
- experimental evaluation
- learning algorithm
- detection algorithm
- worst case
- computational complexity
- np hard
- matching algorithm
- cost function
- dynamic programming
- optimal solution
- preprocessing
- optimization algorithm
- theoretical analysis
- expectation maximization
- particle swarm optimization
- linear programming
- computational cost
- times faster
- search space
- recognition algorithm
- approximation ratio
- geometric shapes
- probabilistic model
- simulated annealing
- high accuracy
- special case
- significant improvement
- objective function
- similarity measure