@InProceedings{mestre_et_al:LIPIcs.ISAAC.2022.7,
author = {Mestre, Juli\'{a}n and Pupyrev, Sergey},
title = {{Approximating the Minimum Logarithmic Arrangement Problem}},
booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)},
pages = {7:1--7:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-258-7},
ISSN = {1868-8969},
year = {2022},
volume = {248},
editor = {Bae, Sang Won and Park, Heejin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.7},
URN = {urn:nbn:de:0030-drops-172924},
doi = {10.4230/LIPIcs.ISAAC.2022.7},
annote = {Keywords: approximation algorithms, graph compression}
}