Request file

Review/Citation:  BÖTTCHER, J., HLADKÝ, Jan, PIGUET, Diana, TARAZ, A. An Approximate Version of the Tree Packing Conjecture via Random Embeddings. In: JANSEN, K., ed. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. Dagstuhl: Schloss Dagstuhl-Leibniz-Zentrum fur Informatik GmbH, 2014, s. 490-499. Leibniz International Proceedings in Informatics, 28. ISBN 978-3-939897-74-3. ISSN 1868-8969
Requested document:  a0460227.pdf - Publisher’s postprint
The requested document is not available in open access mode. But it is possible to ask the author for a copy of the document through the form below. If your application is accepted, you will receive a document by e - mail.

Fields marked with * are obligatory.

(Universities, research institutions, associations …)

a0460227.pdf

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.