1+ ε approximation of tree edit distance in quadratic time-Reference-Cited by-同舟云学术

1+ ε approximation of tree edit distance in quadratic time

Published:2019-06-23 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing
language:
Short-container-title:

Author:

Boroujeni Mahdi¹,Ghodsi Mohammad²,Hajiaghayi MohammadTaghi³,Seddighin Saeed³

Affiliation:

1. Sharif University of Technology, Iran

2. Sharif University of Technology, Iran / Institute for Research in Fundamental Sciences, Iran

3. University of Maryland, USA

Funder

DARPA SIMPLEX

NSF AF:Medium

DARPA GRAPHS/AFOSR

NSF CAREER

NSF BIGDATA

Publisher

ACM

Link

Reference55 articles.

1. Amir Abboud. 2014. Hardness for Easy Problems. (2014). Amir Abboud. 2014. Hardness for Easy Problems. (2014).

2. Stephen Alstrup Thore Husfeldt and Theis Rauhe. 1998. Stephen Alstrup Thore Husfeldt and Theis Rauhe. 1998.

3. Marked Ancestor Problems. In FOCS. IEEE 534–543. Marked Ancestor Problems. In FOCS. IEEE 534–543.

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Weighted Edit Distance Computation: Strings, Trees, and Dyck;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02

2. Õ(n+poly(k))-time Algorithm for Bounded Tree Edit Distance;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10

3. WRS: Workflow Retrieval System for Cloud Automatic Remediation;NOMS 2022-2022 IEEE/IFIP Network Operations and Management Symposium;2022-04-25

4. Breaking the Cubic Barrier for (Unweighted) Tree Edit Distance;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02