Approximating the Minimum Logarithmic Arrangement Problem

被引：0
|
作者：
Mestre, Julián [1 ,2 ]
Pupyrev, Sergey [1 ]
机构：
[1] Meta Platforms Inc., United States
[2] School of Computer Science, The University of Sydney, Australia
来源：
Leibniz International Proceedings in Informatics, LIPIcs | 2022年 / 248卷
关键词：
Compendex;
D O I：
33rd International Symposium on Algorithms and Computation, ISAAC 2022
中图分类号：
学科分类号：
摘要：
Approximation algorithms
引用
收藏
相关论文
共 50 条
  • [31] Approximating the minimum cycle mean
    Chatterjee, Krishnendu
    Henzinger, Monika
    Krinninger, Sebastian
    Loitzenbauer, Veronika
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2013, (119): : 136 - 149
  • [32] APPROXIMATING THE MINIMUM EQUIVALENT DIGRAPH
    KHULLER, S
    RAGHAVACHARI, B
    YOUNG, N
    SIAM JOURNAL ON COMPUTING, 1995, 24 (04) : 859 - 872
  • [33] Approximating Minimum Reset Sequences
    Gerbush, Michael
    Heeringa, Brent
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, 2011, 6482 : 154 - +
  • [34] On minimum circular arrangement
    Ganapathy, MK
    Lodha, SP
    STACS 2004, PROCEEDINGS, 2004, 2996 : 394 - 405
  • [35] An improved lower bound for approximating the Minimum Integral Solution Problem with Preprocessing over norm
    Chen, Wenbin
    Peng, Lingxi
    Wang, Jianxiong
    Li, Fufang
    Tang, Maobin
    Xiong, Wei
    Wang, Songtao
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2015, 30 (03) : 447 - 455
  • [36] New relationships for multi-neighborhood search for the minimum linear arrangement problem
    Glover F.
    Rego C.
    Journal of Discrete Algorithms, 2017, 46-47 : 16 - 24
  • [37] Approximating Characteristics of the Analogs of Besov Classes with Logarithmic Smoothness
    Stasyuk, S. A.
    UKRAINIAN MATHEMATICAL JOURNAL, 2014, 66 (04) : 553 - 560
  • [38] Approximating Characteristics of the Analogs of Besov Classes with Logarithmic Smoothness
    S. A. Stasyuk
    Ukrainian Mathematical Journal, 2014, 66 : 553 - 560
  • [39] Approximating minimum unsatisfiability of linear equations
    Berman, P
    Karpinski, M
    PROCEEDINGS OF THE THIRTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2002, : 514 - 516
  • [40] Approximating a Minimum Dominating Set by Purification
    Inza, Ernesto Parra
    Vakhania, Nodari
    Almira, Jose Maria Sigarreta
    Hernandez-Aguilar, Jose Alberto
    ALGORITHMS, 2024, 17 (06)
12345