NP-HARD PROBLEMS IN HIERARCHICAL-TREE CLUSTERING

被引：126
|
作者：
KRIVANEK, M [1 ]
MORAVEK, J [1 ]
机构：
[1] CZECHOSLOVAK ACAD SCI, INST MATH, CS-11567 PRAHA 1, CZECHOSLOVAKIA
来源：
ACTA INFORMATICA | 1986年 / 23卷 / 03期
关键词：
D O I：
10.1007/BF00289116
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：311 / 323
页数：13
相关论文
共 50 条
  • [1] NP-hard approximation problems in overlapping clustering
    Barthélemy J.-P.
    Brucker F.
    [J]. Journal of Classification, 2001, 18 (2) : 159 - 183
  • [2] NP-hard approximation problems in overlapping clustering
    Barthélemy, JP
    Brucker, F
    [J]. JOURNAL OF CLASSIFICATION, 2001, 18 (02) : 159 - 183
  • [3] POLYNOMIAL BOUNDING FOR NP-HARD PROBLEMS
    CAMERINI, PM
    MAFFIOLI, F
    [J]. MATHEMATICAL PROGRAMMING STUDY, 1980, 12 (APR): : 115 - 119
  • [4] Most Tensor Problems Are NP-Hard
    Hillar, Christopher J.
    Lim, Lek-Heng
    [J]. JOURNAL OF THE ACM, 2013, 60 (06)
  • [5] DECOMPOSITION OF ARITHMETICAL NP-HARD PROBLEMS
    MEJZLIK, P
    [J]. INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1993, 48 (1-2) : 31 - 38
  • [6] Dynamic Programming for NP-Hard Problems
    Wang, Xiaodong
    Tian, Jun
    [J]. CEIS 2011, 2011, 15
  • [7] The Fault Tolerance of NP-Hard Problems
    Glasser, Christian
    Pavan, A.
    Travers, Stephen
    [J]. LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS, 2009, 5457 : 374 - +
  • [8] The fault tolerance of NP-hard problems
    Glasser, Christian
    Pavan, A.
    Travers, Stephen
    [J]. INFORMATION AND COMPUTATION, 2011, 209 (03) : 443 - 455
  • [9] NP-HARD MODULE ROTATION PROBLEMS
    AHN, K
    SAHNI, S
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 1993, 42 (12) : 1506 - 1510
  • [10] SOME NP-HARD POLYGON DECOMPOSITION PROBLEMS
    OROURKE, J
    SUPOWIT, KJ
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1983, 29 (02) : 181 - 190
12345