✦ LIBER ✦

Approximating Edit Distance in Near-Linear Time

✍ Scribed by Andoni, Alexandr; Onak, Krzysztof

Book ID: 118154609
Publisher: Society for Industrial and Applied Mathematics
Year: 2012
Tongue: English
Weight: 248 KB
Volume: 41
Category: Article
ISSN: 0097-5397
DOI: 10.1137/090767182

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximating optimum branchings in line

Approximating optimum branchings in linear time

✍ Valentin Ziegler 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 174 KB

Near-Linear Time Approximation Algorithm

Near-Linear Time Approximation Algorithms for Curve Simplification

✍ Pankaj K. Agarwal; Sariel Har-Peled; Nabil H. Mustafa; Yusu Wang 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 404 KB

Approximating the Metric TSP in Linear T

Approximating the Metric TSP in Linear Time

✍ Davide Bilò; Luca Forlizzi; Guido Proietti 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 693 KB

An Edit-Distance Model for the Approxima

An Edit-Distance Model for the Approximate Matching of Timed Strings

✍ Dobrisek, S.; Zibert, J.; Pavesic, N.; Mihelic, F. 📂 Article 📅 2009 🏛 IEEE 🌐 English ⚖ 456 KB

Approximating Maximum Leaf Spanning Tree

Approximating Maximum Leaf Spanning Trees in Almost Linear Time

✍ Hsueh-I Lu; R Ravi 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 206 KB

Given an undirected graph, finding a spanning tree of the graph with the maximum number of leaves is MAX SNP-complete. In this paper we give a new greedy 3-approximation algorithm for maximum leaf spanning trees. The running ŽŽ . Ž .. time O m q n ␣ m, n required by our algorithm, where m is the num

Approximating Tverberg Points in Linear

Approximating Tverberg Points in Linear Time for Any Fixed Dimension

✍ Wolfgang Mulzer, Daniel Werner 📂 Article 📅 2013 🏛 Springer 🌐 English ⚖ 255 KB