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 条
  • [31] A note on hardness of diameter approximation
    Bringmann, Karl
    Krinninger, Sebastian
    INFORMATION PROCESSING LETTERS, 2018, 133 : 10 - 15
  • [32] Hardness of Approximation for Quantum Problems
    Gharibian, Sevag
    Kempe, Julia
    AUTOMATA, LANGUAGES, AND PROGRAMMING, ICALP 2012 PT I, 2012, 7391 : 387 - 398
  • [33] Hardness of Approximation for Crossing Number
    Sergio Cabello
    Discrete & Computational Geometry, 2013, 49 : 348 - 358
  • [34] On the Hardness and Approximation of Euclidean DBSCAN
    Gan, Junhao
    Tao, Yufei
    ACM TRANSACTIONS ON DATABASE SYSTEMS, 2017, 42 (03):
  • [35] Hardness and approximation of traffic grooming
    Amini, Omid
    Perennes, Stephane
    Sau, Ignasi
    THEORETICAL COMPUTER SCIENCE, 2009, 410 (38-40) : 3751 - 3760
  • [36] Constrained LCS: Hardness and approximation
    Gotthilf, Zvi
    Hermelin, Danny
    Lewenstein, Moshe
    COMBINATORIAL PATTERN MATCHING, 2008, 5029 : 255 - +
  • [37] A note on the hardness of sparse approximation
    Civril, A.
    INFORMATION PROCESSING LETTERS, 2013, 113 (14-16) : 543 - 545
  • [38] Improved Image Classification With Token Fusion
    Choi, Keong-Hun
    Kim, Jin-Woo
    Wang, Yao
    Ha, Jong-Eun
    IEEE ACCESS, 2023, 11 : 67460 - 67467
  • [39] Finding Optimal Solutions to Token Swapping by Conflict-based Search and Reduction to SAT
    Surynek, Pavel
    2018 IEEE 30TH INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE (ICTAI), 2018, : 592 - 599
  • [40] Finding optimal solutions to token swapping by conflict-based search and reduction to SAT
    Faculty of Information Technology, Czech Technical University, Prague, Czech Republic
    arXiv, 1600,
12345