𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Distribution of Distances and Triangles in a Point Set and Algorithms for Computing the Largest Common Point Sets

✍ Scribed by Akutsu, T.; Tamaki, H.; Tokuyama, T.

Book ID
113012505
Publisher
Springer
Year
1998
Tongue
English
Weight
312 KB
Volume
20
Category
Article
ISSN
0179-5376

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the approximation of largest common s
On the approximation of largest common subtrees and largest common point sets
✍ Tatsuya Akutsu; MagnΓΊs M. HalldΓ³rsson πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 136 KB

This paper considers the approximability of the largest common subtree and the largest common point-set problems, which have applications in molecular biology. It is shown that the problems cannot be approximated within a factor of n 1-in polynomial time for any ΒΏ0 unless NP βŠ† ZPP, while a general s