Recurrence relations based on minimization and maximization
From MaRDI portal
Recommendations
- An asymptotic theory for recurrence relations based on minimization and maximization.
- Solution of a Divide-and-Conquer Maximin Recurrence
- Tighter Bounds on the Solution of a Divide-and-Conquer Maximin Recurrence
- Exact balancing is not always good
- Multidimensional Divide-and-Conquer Maximin Recurrences
Cites work
- scientific article; zbMATH DE number 3750146 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- Divide and Conquer Heuristics for Minimum Weighted Euclidean Matching
- On a Greedy Heuristic for Complete Matching
- Recurrence relations based on minimization
Cited in
(10)- scientific article; zbMATH DE number 3846336 (Why is no real title available?)
- An asymptotic theory for recurrence relations based on minimization and maximization.
- scientific article; zbMATH DE number 2172765 (Why is no real title available?)
- Exact solution of a minimal recurrence
- On the cost of optimal alphabetic code trees with unequal letter costs
- An Algorithm for Computing Minimal Bidirectional Linear Recurrence Relations
- Solution of a Linear Recurrence Equation Arising in the Analysis of Some Algorithms
- scientific article; zbMATH DE number 6378818 (Why is no real title available?)
- Analytic solution of a special class of recurrence relations for the analysis of recursive algorithms
- Asymptotic limits of a new type of maximization recurrence with an application to bioinformatics
This page was built for publication: Recurrence relations based on minimization and maximization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1079343)
