An Approximation Algorithm for the Matrix Tree Multiplication Problem
Mahmoud Abo−Khamis‚ Ryan Curtin‚ Sungjin Im‚ Benjamin Moseley‚ Hung Ngo‚ Kirk Pruhs and Alireza Samadian
Address
Dagstuhl‚ Germany
Annote
Keywords: Matrix Multiplication‚ Approximation Algorithm
Book Title
46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)
Editor
Bonchi‚ Filippo and Puglisi‚ Simon J.
ISBN
978−3−95977−201−3
ISSN
1868−8969
Pages
6:1–6:14
Publisher
Schloss Dagstuhl – Leibniz−Zentrum für Informatik
Series
Leibniz International Proceedings in Informatics (LIPIcs)
Volume
202
Year
2021