Approximation and hardness of token swapping

被引：0
|
作者：
机构：
[1] Miltzow, Tillmann
[2] Narins, Lothar
[3] Okamoto, Yoshio
[4] Rote, Günter
[5] Thomas, Antonis
[6] Uno, Takeaki
来源：
| 2016年 / Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing卷 / 57期
关键词：
721.1 Computer Theory; Includes Formal Logic; Automata Theory; Switching Theory; Programming Theory - 921 Mathematics - 921.4 Combinatorial Mathematics; Includes Graph Theory; Set Theory - 921.6 Numerical Methods - 951 Materials Science;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
24
引用
收藏
相关论文
共 50 条
  • [31] A note on the hardness of sparse approximation
    Civril, A.
    INFORMATION PROCESSING LETTERS, 2013, 113 (14-16) : 543 - 545
  • [32] 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
  • [33] 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,
  • [34] A hardness of approximation result in metric geometry
    Brady, Zarathustra
    Guth, Larry
    Manin, Fedor
    SELECTA MATHEMATICA-NEW SERIES, 2020, 26 (04):
  • [35] Proof verification and the hardness of approximation problems
    Princeton Univ, Princeton, United States
    J ACM, 3 (501-555):
  • [36] Approximation hardness of dominating set problems
    Chlebík, M
    Chlebíková, J
    ALGORITHMS ESA 2004, PROCEEDINGS, 2004, 3221 : 192 - 203
  • [37] Metric Violation Distance: Hardness and Approximation
    Fan, Chenglin
    Raichel, Benjamin
    Van Buskirk, Gregory
    ALGORITHMICA, 2022, 84 (05) : 1441 - 1465
  • [38] 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
  • [39] On the Parameterized and Approximation Hardness of Metric Dimension
    Hartung, Sepp
    Nichterlein, Andre
    2013 IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY (CCC), 2013, : 266 - 276
  • [40] 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
12345