A simple algorithm and min-max formula for the inverse arborescence problem.
András FrankGergely HajduPublished in: Discret. Appl. Math. (2021)
Keyphrases
- min max
- experimental evaluation
- max min
- times faster
- theoretical analysis
- learning algorithm
- recognition algorithm
- worst case
- cost function
- preprocessing
- dynamic programming
- computational complexity
- computational cost
- tree structure
- detection algorithm
- knapsack problem
- simulated annealing
- computationally efficient
- probabilistic model
- np hard
- optimal solution
- input data
- segmentation algorithm
- data sets
- matching algorithm
- significant improvement
- search space
- improved algorithm
- objective function
- correlation matrix
- max cut