Abstract

We show that every $$n$$ -point tree metric admits a $$(1+\varepsilon )$$ -embedding into $$\ell _1^{C(\varepsilon ) \log n}$$ , for every $$\varepsilon > 0$$ , where $$C(\varepsilon ) \le O\big ((\frac{1}{\varepsilon })^4 \log \frac{1}{\varepsilon })\big )$$ . This matches the natural volume lower bound up to a factor depending only on $$\varepsilon $$ . Previously, it was unknown whether even complete binary trees on $$n$$ nodes could be embedded in $$\ell _1^{O(\log n)}$$ with $$O(1)$$ distortion. For complete $$d$$ -ary trees, our construction achieves $$C(\varepsilon ) \le O\big (\frac{1}{\varepsilon ^2}\big )$$ .

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.