Julián Mestre, Sergey Pupyrev. Approximating the Minimum Logarithmic Arrangement Problem. In Sang Won Bae, Heejin Park, editors, 33rd International Symposium on Algorithms and Computation, ISAAC 2022, December 19-21, 2022, Seoul, Korea. Volume 248 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. [doi]
@inproceedings{MestreP22,
title = {Approximating the Minimum Logarithmic Arrangement Problem},
author = {Julián Mestre and Sergey Pupyrev},
year = {2022},
doi = {10.4230/LIPIcs.ISAAC.2022.7},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.7},
researchr = {https://researchr.org/publication/MestreP22},
cites = {0},
citedby = {0},
booktitle = {33rd International Symposium on Algorithms and Computation, ISAAC 2022, December 19-21, 2022, Seoul, Korea},
editor = {Sang Won Bae and Heejin Park},
volume = {248},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
isbn = {978-3-95977-258-7},
}