A tight bound for shortest augmenting paths on trees.
Bartlomiej BosekDariusz LeniowskiPiotr SankowskiAnna Zych-PawlewiczPublished in: Theor. Comput. Sci. (2022)
Keyphrases
- upper bound
- lower bound
- shortest path
- worst case
- path length
- decision trees
- generalization error bounds
- error bounds
- tree construction
- tree structure
- tree structures
- np hard
- optimal path
- optimal solution
- linear functions
- real world
- generalization error
- vc dimension
- computational complexity
- objective function
- image sequences
- minimum cost path
- shortest common supersequence