Extend quasi-subquadratic (1+ε)-approximation techniques to Tree Edit Distance
Determine whether the randomized sample-and-round framework based on curvature bounds and tree total deviation, developed for edit distance and longest common subsequence, can be adapted to tree edit distance to improve the current nearly quadratic running time of (1+ε)-approximation achieved by Boroujeni, Ghodsi, Hajiaghayi, and Seddighin (STOC 2019).
References
For tree edit distance, we leave it for future work whether our techniques can also apply to improve 's state of the art (nearly) quadratic running time for $(1+)$-approximation.
This gap highlights a glaring open question. Question 1: What is the best approximation achievable for TED in near-linear time? Can we achieve subpolynomial-factor approximation in near-linear or linear time?