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 条
  • [1] Approximating the balanced minimum evolution problem
    Fiorini, Samuel
    Joret, Gwenael
    OPERATIONS RESEARCH LETTERS, 2012, 40 (01) : 31 - 35
  • [2] Approximating the Minimum Chain Completion problem
    Feder, Tomas
    Mannila, Heikki
    Terzi, Evimaria
    INFORMATION PROCESSING LETTERS, 2009, 109 (17) : 980 - 985
  • [3] On minimum cuts and the linear arrangement problem
    Horton, SB
    Parker, RG
    Borie, RB
    DISCRETE APPLIED MATHEMATICS, 2000, 103 (1-3) : 127 - 139
  • [4] Approximating the Generalized Minimum Manhattan Network Problem
    Das, Aparna
    Fleszar, Krzysztof
    Kobourov, Stephen
    Spoerhase, Joachim
    Veeramoni, Sankar
    Wolff, Alexander
    ALGORITHMICA, 2018, 80 (04) : 1170 - 1190
  • [5] Approximating the Generalized Minimum Manhattan Network Problem
    Das, Aparna
    Fleszar, Krzysztof
    Kobourov, Stephen
    Spoerhase, Joachim
    Veeramoni, Sankar
    Wolff, Alexander
    ALGORITHMS AND COMPUTATION, 2013, 8283 : 722 - 732
  • [6] Approximating the Generalized Minimum Manhattan Network Problem
    Aparna Das
    Krzysztof Fleszar
    Stephen Kobourov
    Joachim Spoerhase
    Sankar Veeramoni
    Alexander Wolff
    Algorithmica, 2018, 80 : 1170 - 1190
  • [7] Tractable Parameterizations for the Minimum Linear Arrangement Problem
    Fellows, Michael R.
    Hermelin, Danny
    Rosamond, Frances
    Shachnai, Hadas
    ACM TRANSACTIONS ON COMPUTATION THEORY, 2016, 8 (02)
  • [8] Approximating the minimum hub cover problem on planar graphs
    Yelbay, Belma
    Birbil, S. Ilker
    Bulbul, Kerem
    Jamil, Hasan
    OPTIMIZATION LETTERS, 2016, 10 (01) : 33 - 45
  • [9] Tractable Parameterizations for the Minimum Linear Arrangement Problem
    Fellows, Michael R.
    Hermelin, Danny
    Rosamond, Frances A.
    Shachnai, Hadas
    ALGORITHMS - ESA 2013, 2013, 8125 : 457 - 468
  • [10] Approximating the minimum hub cover problem on planar graphs
    Belma Yelbay
    Ş. İlker Birbil
    Kerem Bülbül
    Hasan Jamil
    Optimization Letters, 2016, 10 : 33 - 45
12345