An exponential time parameterized algorithm for planar disjoint paths.
Daniel LokshtanovPranabendu MisraMichal PilipczukSaket SaurabhMeirav ZehaviPublished in: STOC (2020)
Keyphrases
- preprocessing
- improved algorithm
- objective function
- computational cost
- linear complexity
- optimal solution
- experimental evaluation
- cost function
- high accuracy
- expectation maximization
- tree structure
- computational complexity
- theoretical analysis
- computationally efficient
- times faster
- recognition algorithm
- learning algorithm
- worst case
- significant improvement
- k means
- search space
- neural network
- simulated annealing
- particle swarm optimization
- np hard
- optimization algorithm
- detection algorithm
- convergence rate
- video sequences
- feature selection
- disjoint paths