Document

# An Approximation Algorithm for the Matrix Tree Multiplication Problem

## File

LIPIcs.MFCS.2021.6.pdf
• Filesize: 0.66 MB
• 14 pages

## Acknowledgements

We want to thank David Fernandez-Baca for discussions and pointers related to Markovian phelogeny trees.

## Cite As

Mahmoud Abo-Khamis, Ryan Curtin, Sungjin Im, Benjamin Moseley, Hung Ngo, Kirk Pruhs, and Alireza Samadian. An Approximation Algorithm for the Matrix Tree Multiplication Problem. In 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 202, pp. 6:1-6:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
https://doi.org/10.4230/LIPIcs.MFCS.2021.6

## Abstract

We consider the Matrix Tree Multiplication problem. This problem is a generalization of the classic Matrix Chain Multiplication problem covered in the dynamic programming chapter of many introductory algorithms textbooks. An instance of the Matrix Tree Multiplication problem consists of a rooted tree with a matrix associated with each edge. The output is, for each leaf in the tree, the product of the matrices on the chain/path from the root to that leaf. Matrix multiplications that are shared between various chains need only be computed once, potentially being shared between different root to leaf chains. Algorithms are evaluated by the number of scalar multiplications performed. Our main result is a linear time algorithm for which the number of scalar multiplications performed is at most 15 times the optimal number of scalar multiplications.

## Subject Classification

##### ACM Subject Classification
• Theory of computation → Approximation algorithms analysis
##### Keywords
• Matrix Multiplication
• Approximation Algorithm

## Metrics

• Access Statistics
• Total Accesses (updated on a weekly basis)
0

## References

1. Atılım Günes Baydin, Barak A. Pearlmutter, Alexey Andreyevich Radul, and Jeffrey Mark Siskind. Automatic differentiation in machine learning: A survey. J. Mach. Learn. Res., 18(1):5595–5637, 2017.
2. A. K. Chandra. Computing matrix chain products in near optimal time. IBM Research Report, RC 5625(24393), 1975. IBM T.J. Watson Research Center.
3. Francis Y. L. Chin. An o(n) algorithm for determining a near-optimal computation order of matrix chain products. Communications of the ACM, 21(7):544-549, 1978.
4. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms, 3rd Edition. MIT Press, 2009.
5. Andreas Griewank and Andrea Walther. Evaluating Derivatives. Society for Industrial and Applied Mathematics, second edition, 2008. URL: https://doi.org/10.1137/1.9780898717761.
6. T. C. Hu and M. T. Shing. An o(n) algorithm to find a near-optimum partition of a convex polygon. Journal of Algorithms, 2(2):122-138, 1981.
7. T. C. Hu and M. T. Shing. Computation of matrix chain products. part I. SIAM Journal of Computing, 11(2):362-373, 1982.
8. T. C. Hu and M. T. Shing. Computation of matrix chain products. part II. SIAM Journal of Computing, 13(2):228-251, 1984.
9. Mike Steel. Phylogeny: Discrete and Random Processes in Evolution. SIAM-Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2016.
X

Feedback for Dagstuhl Publishing