Go to the corresponding LIPIcs Volume Portal 
AboKhamis, Mahmoud ; Curtin, Ryan ; Im, Sungjin ; Moseley, Benjamin ; Ngo, Hung ; Pruhs, Kirk ; Samadian, Alireza
pdfformat: 

@InProceedings{abokhamis_et_al:LIPIcs.MFCS.2021.6, author = {AboKhamis, Mahmoud and Curtin, Ryan and Im, Sungjin and Moseley, Benjamin and Ngo, Hung and Pruhs, Kirk and Samadian, Alireza}, title = {{An Approximation Algorithm for the Matrix Tree Multiplication Problem}}, booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)}, pages = {6:16:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959772013}, ISSN = {18688969}, year = {2021}, volume = {202}, editor = {Bonchi, Filippo and Puglisi, Simon J.}, publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2021/14446}, URN = {urn:nbn:de:0030drops144464}, doi = {10.4230/LIPIcs.MFCS.2021.6}, annote = {Keywords: Matrix Multiplication, Approximation Algorithm} }
Keywords:  Matrix Multiplication, Approximation Algorithm  
Collection:  46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)  
Issue Date:  2021  
Date of publication:  18.08.2021 