An ETH-Tight Algorithm for Bidirected Steiner Connectivity.
Daniel LokshtanovPranabendu MisraFahad PanolanSaket SaurabhMeirav ZehaviPublished in: WADS (2023)
Keyphrases
- learning algorithm
- detection algorithm
- high accuracy
- worst case
- optimal solution
- improved algorithm
- times faster
- dynamic programming
- np hard
- cost function
- computational complexity
- experimental study
- selection algorithm
- significant improvement
- preprocessing
- recognition algorithm
- segmentation algorithm
- computationally efficient
- clustering method
- path planning
- expectation maximization
- probabilistic model
- computational cost
- k means
- single pass
- similarity measure
- steiner tree
- upper bound
- matching algorithm
- experimental evaluation
- multi objective
- search space
- search algorithm
- feature selection