Go to the corresponding LIPIcs Volume Portal 
Mestre, Julián ; Pupyrev, Sergey
pdfformat: 

@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:17:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959772587}, ISSN = {18688969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2022/17292}, URN = {urn:nbn:de:0030drops172924}, doi = {10.4230/LIPIcs.ISAAC.2022.7}, annote = {Keywords: approximation algorithms, graph compression} }
Keywords:  approximation algorithms, graph compression  
Collection:  33rd International Symposium on Algorithms and Computation (ISAAC 2022)  
Issue Date:  2022  
Date of publication:  14.12.2022 