Approximating the minimum logarithmic arrangement problem

DOI10.4230/LIPICS.ISAAC.2022.7MaRDI QIDQ6602423zbMATH OpenFDO

Authors Julián Mestre, Sergey Pupyrev

Publication date 11 September 2024

Full work available at URL https://doi.org/10.4230/LIPICS.ISAAC.2022.7

zbMATH Keywords

approximation algorithmsgraph compression

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

This page was built for publication: Approximating the minimum logarithmic arrangement problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6602423)