https://openreview.net/forum?id=4eeERA5j3k&referrer=%5Bthe%20profile%20of%20Daichi%20Amagata%5D(%2Fprofile%3Fid%3D~Daichi_Amagata1)
This paper addresses the problem of building the Euclidean minimum spanning tree (EMST) of a high-dimensional dataset. The EMST problem has a number of...
minimum spanning treeapproximation algorithmfasteuclideanbuilding
https://www.arxiv.org/abs/2208.00740
Abstract page for arXiv paper 2208.00740: A simple polynomial-time approximation algorithm for the total variation distance between two product distributions
polynomial timeapproximation algorithmsimple
https://arxiv.org/abs/1609.04029
Abstract page for arXiv paper 1609.04029: A Cubic-Time 2-Approximation Algorithm for rSPR Distance
cubic timeapproximation algorithm