Improved Hardness-of-Approximation for Token Swapping

被引：0
|
作者：
Hiken, Sam [1 ]
Wein, Nicole [2 ]
机构：
[1] MIT, United States
[2] University of Michigan, United States
来源：
arXiv |
关键词：
1102.1; -; 1103.3; 1105.3; 1106.1;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
NP-hard
引用
收藏
相关论文
共 50 条
  • [21] When Hardness of Approximation Meets Hardness of Learning
    Malach, Eran
    Shalev-Shwartz, Shai
    Journal of Machine Learning Research, 2022, 23
  • [22] Algorithms and Hardness for Subspace Approximation
    Deshpande, Amit
    Tulsiani, Madhur
    Vishnoi, Nisheeth K.
    PROCEEDINGS OF THE TWENTY-SECOND ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2011, : 482 - 496
  • [23] HARDNESS OF APPROXIMATION FOR QUANTUM PROBLEMS
    Gharibian, Sevag
    Kempe, Julia
    QUANTUM INFORMATION & COMPUTATION, 2014, 14 (5-6) : 517 - 540
  • [24] Hardness of approximation for quantum problems
    Gharibian, Sevag
    Kempe, Julia
    1600, Rinton Press Inc. (14): : 5 - 6
  • [25] Hardness of Approximation for Knapsack Problems
    Harry Buhrman
    Bruno Loff
    Leen Torenvliet
    Theory of Computing Systems, 2015, 56 : 372 - 393
  • [26] Hardness and approximation of traffic grooming
    Amini, Omid
    Perennes, Stephane
    Sau, Ignasi
    ALGORITHMS AND COMPUTATION, 2007, 4835 : 561 - 573
  • [27] ELECTRONEGATIVITY AND HARDNESS IN THE CHEMICAL APPROXIMATION
    KOMOROWSKI, L
    CHEMICAL PHYSICS, 1987, 114 (01) : 55 - 71
  • [28] Simultaneous matchings: Hardness and approximation
    Kutz, Martin
    Elbassioni, Khaled
    Katriel, Irit
    Mahajan, Meena
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2008, 74 (05) : 884 - 897
  • [29] Hardness of Approximation for Crossing Number
    Cabello, Sergio
    DISCRETE & COMPUTATIONAL GEOMETRY, 2013, 49 (02) : 348 - 358
  • [30] Hardness of Approximation for Knapsack Problems
    Buhrman, Harry
    Loff, Bruno
    Torenvliet, Leen
    THEORY OF COMPUTING SYSTEMS, 2015, 56 (02) : 372 - 393
12345