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 条
  • [31] NP-hard Problems of Learning From Examples
    Chen, Bin
    Quan, Guangri
    [J]. FIFTH INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS AND KNOWLEDGE DISCOVERY, VOL 2, PROCEEDINGS, 2008, : 182 - 186
  • [32] Nested quantum search and NP-hard problems
    Cerf, NJ
    Grover, LK
    Williams, CP
    [J]. APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 2000, 10 (4-5) : 311 - 338
  • [33] 2 NP-HARD INTERCHANGEABLE TERMINAL PROBLEMS
    SAHNI, S
    WU, SY
    [J]. IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1988, 7 (04) : 467 - 472
  • [34] An Approach to Resolve NP-Hard Problems of Firewalls
    Khoumsi, Ahmed
    Erradi, Mohamed
    Ayache, Meryeme
    Krombi, Wadie
    [J]. NETWORKED SYSTEMS, NETYS 2016, 2016, 9944 : 229 - 243
  • [35] A categorical approach to NP-hard optimization problems
    Leal, LAD
    Claudio, DM
    Toscani, LV
    Menezes, PB
    [J]. COMPUTER AIDED SYSTEMS THEORY - EUROCAST 2003, 2003, 2809 : 62 - 73
  • [36] NP-hard approximation problems in overlapping clustering
    Barthélemy, JP
    Brucker, F
    [J]. JOURNAL OF CLASSIFICATION, 2001, 18 (02) : 159 - 183
  • [37] The inapproximability of non NP-hard optimization problems
    Cai, LM
    Juedes, D
    Kanj, I
    [J]. ALGORITHMS AND COMPUTATIONS, 1998, 1533 : 437 - 446
  • [38] NP-hard approximation problems in overlapping clustering
    Barthélemy J.-P.
    Brucker F.
    [J]. Journal of Classification, 2001, 18 (2) : 159 - 183
  • [39] NC algorithms for partitioning planar graphs into induced forests and approximating NP-hard problems
    Chen, ZZ
    He, X
    [J]. GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 1995, 1017 : 275 - 289
  • [40] LINEAR TIME ALGORITHMS FOR NP-HARD PROBLEMS RESTRICTED TO PARTIAL K-TREES
    ARNBORG, S
    PROSKUROWSKI, A
    [J]. DISCRETE APPLIED MATHEMATICS, 1989, 23 (01) : 11 - 24
12345