Improved Hardness-of-Approximation for Token Swapping

被引:0
|
作者
Hiken, Sam [1 ]
Wein, Nicole [2 ]
机构
[1] MIT, United States
[2] University of Michigan, United States
来源
关键词
1102.1; -; 1103.3; 1105.3; 1106.1;
D O I
暂无
中图分类号
学科分类号
摘要
NP-hard
引用
收藏
相关论文
共 50 条
  • [41] A hardness of approximation result in metric geometry
    Brady, Zarathustra
    Guth, Larry
    Manin, Fedor
    SELECTA MATHEMATICA-NEW SERIES, 2020, 26 (04):
  • [42] Approximation hardness of dominating set problems
    Chlebík, M
    Chlebíková, J
    ALGORITHMS ESA 2004, PROCEEDINGS, 2004, 3221 : 192 - 203
  • [43] Metric Violation Distance: Hardness and Approximation
    Fan, Chenglin
    Raichel, Benjamin
    Van Buskirk, Gregory
    ALGORITHMICA, 2022, 84 (05) : 1441 - 1465
  • [44] Proof verification and the hardness of approximation problems
    Princeton Univ, Princeton, United States
    J ACM, 3 (501-555):
  • [45] Metric Violation Distance: Hardness and Approximation
    Fan, Chenglin
    Raichel, Benjamin
    Van Buskirk, Gregory
    SODA'18: PROCEEDINGS OF THE TWENTY-NINTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2018, : 196 - 209
  • [46] On the Parameterized and Approximation Hardness of Metric Dimension
    Hartung, Sepp
    Nichterlein, Andre
    2013 IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY (CCC), 2013, : 266 - 276
  • [47] Distributed Verification and Hardness of Distributed Approximation
    Das Sarma, Atish
    Holzer, Stephan
    Kor, Liah
    Korman, Amos
    Nanongkai, Danupon
    Pandurangan, Gopal
    Peleg, David
    Wattenhofer, Roger
    STOC 11: PROCEEDINGS OF THE 43RD ACM SYMPOSIUM ON THEORY OF COMPUTING, 2011, : 363 - 372
  • [48] Hardness and approximation of octilinear Steiner trees
    Müller-Hannemann, M
    Schulze, A
    ALGORITHMS AND COMPUTATION, 2005, 3827 : 256 - 265
  • [49] Approximation and hardness of Shift-Bribery
    Faliszewski, Piotr
    Manurangsi, Pasin
    Sornat, Krzysztof
    ARTIFICIAL INTELLIGENCE, 2021, 298
  • [50] Proof verification and the hardness of approximation problems
    Arora, S
    Lund, C
    Motwani, R
    Sudan, M
    Szegedy, M
    JOURNAL OF THE ACM, 1998, 45 (03) : 501 - 555