@inproceedings{abokhamis_et_al:LIPIcs.MFCS.2021.6,
  title = "{An Approximation Algorithm for the Matrix Tree Multiplication Problem}",
  author = "Abo-Khamis, Mahmoud and Curtin, Ryan and Im, Sungjin and Moseley, Benjamin and Ngo, Hung and Pruhs, Kirk and Samadian, Alireza",
  year = "2021",
  address = "Dagstuhl, Germany",
  annote = "Keywords: Matrix Multiplication, Approximation Algorithm",
  booktitle = "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{\"u}r Informatik",
  series = "Leibniz International Proceedings in Informatics (LIPIcs)",
  url = "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.6",
  volume = "202",
  doi = "10.4230/LIPIcs.MFCS.2021.6",
}