Abo Khamis, Mahmoud, Curtin, Ryan, Im, Sungjin, Moseley, Ben, Ngo, Hung, Pruhs, Kirk, and Samadian, Alireza. An Approximation Algorithm for the Matrix Tree Multiplication Problem. Retrieved from https://par.nsf.gov/biblio/10296130. Symposium on Mathematical Foundations of Computer Science 202. Web. doi:10.4230/LIPIcs.MFCS.2021.6.

Abo Khamis, Mahmoud, Curtin, Ryan, Im, Sungjin, Moseley, Ben, Ngo, Hung, Pruhs, Kirk, & Samadian, Alireza. An Approximation Algorithm for the Matrix Tree Multiplication Problem. Symposium on Mathematical Foundations of Computer Science, 202 (). Retrieved from https://par.nsf.gov/biblio/10296130. https://doi.org/10.4230/LIPIcs.MFCS.2021.6

Abo Khamis, Mahmoud, Curtin, Ryan, Im, Sungjin, Moseley, Ben, Ngo, Hung, Pruhs, Kirk, and Samadian, Alireza. "An Approximation Algorithm for the Matrix Tree Multiplication Problem". Symposium on Mathematical Foundations of Computer Science 202 (). Country unknown/Code not available. https://doi.org/10.4230/LIPIcs.MFCS.2021.6. https://par.nsf.gov/biblio/10296130.

@article{osti_10296130,
place = {Country unknown/Code not available}, title = {An Approximation Algorithm for the Matrix Tree Multiplication Problem}, url = {https://par.nsf.gov/biblio/10296130}, DOI = {10.4230/LIPIcs.MFCS.2021.6}, abstractNote = {}, journal = {Symposium on Mathematical Foundations of Computer Science}, volume = {202}, author = {Abo Khamis, Mahmoud and Curtin, Ryan and Im, Sungjin and Moseley, Ben and Ngo, Hung and Pruhs, Kirk and Samadian, Alireza}, }