Number of the records: 1
An Approximate Version of the Tree Packing Conjecture via Random Embeddings
- 1.0460227 - ÚI 2017 DE eng C - Conference Paper (international conference)
Böttcher, J. - Hladký, Jan - Piguet, Diana - Taraz, A.
An Approximate Version of the Tree Packing Conjecture via Random Embeddings.
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. Dagstuhl: Schloss Dagstuhl-Leibniz-Zentrum fur Informatik GmbH, 2014 - (Jansen, K.), s. 490-499. Leibniz International Proceedings in Informatics, 28. ISBN 978-3-939897-74-3. ISSN 1868-8969.
[APPROX-RANDOM 2014. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems /17./ and the International Workshop on Randomization and Computation /18./. Barcelona (ES), 04.09.2014-06.09.2014]
http://drops.dagstuhl.de/opus/volltexte/2014/4718
Permanent Link: http://hdl.handle.net/11104/0260317
File Download Size Commentary Version Access a0460227.pdf 1 487.9 KB Publisher’s postprint require
Number of the records: 1