Exact algorithms for NP-hard problems: A survey

被引：0
|
作者：
Woeginger, GJ [1 ]
机构：
[1] Univ Twente, Dept Math, NL-7500 AE Enschede, Netherlands
来源：
COMBINATORIAL OPTIMIZATION - EUREKA, YOU SHRINK: PAPERS DEDICATED TO JACK EDMONDS | 2003年 / 2570卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We discuss fast exponential time solutions for NP-complete problems. We survey known results and approaches, we provide pointers to the literature, and we discuss several open problems in this area. The list of discussed NP-complete problems includes the travelling salesman problem, scheduling under precedence constraints, satisfiability, knapsack, graph coloring, independent sets in graphs, bandwidth of a graph, and many more.
引用
收藏
页码：185 / 207
页数：23
相关论文
共 50 条
  • [1] Parameterized algorithms of fundamental NP-hard problems: a survey
    Li, Wenjun
    Ding, Yang
    Yang, Yongjie
    Sherratt, R. Simon
    Park, Jong Hyuk
    Wang, Jin
    [J]. HUMAN-CENTRIC COMPUTING AND INFORMATION SCIENCES, 2020, 10 (01)
  • [2] Faster exact solutions for some NP-hard problems
    Drori, L
    Peleg, D
    [J]. THEORETICAL COMPUTER SCIENCE, 2002, 287 (02) : 473 - 499
  • [3] Typical performance of approximation algorithms for NP-hard problems
    Takabe, Satoshi
    Hukushima, Koji
    [J]. JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2016,
  • [4] SOME OBSERVATIONS ON THE PROBABILISTIC ALGORITHMS AND NP-HARD PROBLEMS
    KO, KI
    [J]. INFORMATION PROCESSING LETTERS, 1982, 14 (01) : 39 - 43
  • [5] Polynomial algorithms that prove an NP-hard hypothesis implies an NP-hard conclusion
    Bauer, D
    Broersma, HJ
    Morgana, A
    Schmeichel, E
    [J]. DISCRETE APPLIED MATHEMATICS, 2002, 120 (1-3) : 13 - 23
  • [6] Decomposition Algorithms for Solving NP-hard Problems on a Quantum Annealer
    Elijah Pelofske
    Georg Hahn
    Hristo Djidjev
    [J]. Journal of Signal Processing Systems, 2021, 93 : 405 - 420
  • [7] Decomposition Algorithms for Solving NP-hard Problems on a Quantum Annealer
    Pelofske, Elijah
    Hahn, Georg
    Djidjev, Hristo
    [J]. JOURNAL OF SIGNAL PROCESSING SYSTEMS FOR SIGNAL IMAGE AND VIDEO TECHNOLOGY, 2021, 93 (04): : 405 - 420
  • [8] Faster exact solutions for some NP-hard problems (extended abstract)
    Drori, L
    Peleg, D
    [J]. ALGORITHMS - ESA'99, 1999, 1643 : 450 - 461
  • [9] Approximation schemes for NP-hard geometric optimization problems: a survey
    Sanjeev Arora
    [J]. Mathematical Programming, 2003, 97 : 43 - 69
  • [10] Approximation schemes for NP-hard geometric optimization problems: a survey
    Arora, S
    [J]. MATHEMATICAL PROGRAMMING, 2003, 97 (1-2) : 43 - 69
12345