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 条

[41] On the hardness of approximating minimum monopoly problems
Mishra, S
Radhakrishnan, J
Sivasubramanian, S
FST TCS 2002: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEOETICAL COMPUTER SCIENCE, PROCEEDINGS, 2002, 2556 : 277 - 288
[42] Approximating minimum quartet inconsistency (Abstract)
Della Vedova, G
Jiang, T
Li, J
Wen, JJ
PROCEEDINGS OF THE THIRTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2002, : 894 - 895
[43] Approximating the Minimum Tour Cover of a Digraph
Nguyen, Viet Hung
ALGORITHMS, 2011, 4 (02): : 75 - 86
[44] A stab at approximating minimum subadditive join
Vinterbo, Staal A.
ALGORITHMS AND DATA STRUCTURES, PROCEEDINGS, 2007, 4619 : 214 - 225
[45] On the hardness of approximating minimum vertex cover
Dinur, I
Safra, S
ANNALS OF MATHEMATICS, 2005, 162 (01) : 439 - 485
[46] APPROXIMATING THE MINIMUM WEIGHT STEINER TRIANGULATION
EPPSTEIN, D
DISCRETE & COMPUTATIONAL GEOMETRY, 1994, 11 (02) : 163 - 191
[47] APPROXIMATING THE BIRTHDAY PROBLEM
SCHWARZ, W
AMERICAN STATISTICIAN, 1988, 42 (03): : 195 - 196
[48] On Approximating a Scheduling Problem
Pierluigi Crescenzi
Xiaotie Deng
Christos H. Papadimitriou
Journal of Combinatorial Optimization, 2001, 5 : 287 - 297
[49] On approximating a scheduling problem
Crescenzi, P
Deng, XT
Papadimitriou, CH
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2001, 5 (03) : 287 - 297
[50] APPROXIMATING THE MINIMUM MAXIMAL INDEPENDENCE NUMBER
HALLDORSSON, MM
INFORMATION PROCESSING LETTERS, 1993, 46 (04) : 169 - 172