Efficient Approximation Algorithms for Some NP-hard Problems of Partitioning a Set and a Sequence

被引：0
|
作者：
Kel'manov, Alexander [1 ]
机构：
[1] Novosibirsk State Univ, Sobolev Inst Math, Novosibirsk, Russia
来源：
2017 INTERNATIONAL MULTI-CONFERENCE ON ENGINEERING, COMPUTER AND INFORMATION SCIENCES (SIBIRCON) | 2017年
基金：
俄罗斯基础研究基金会; 俄罗斯科学基金会;
关键词：
Data analysis; partitioning; NP-hardness; efficient algorithms with performance guarantees; EUCLIDEAN 2-CLUSTERING PROBLEMS; CLUSTER-ANALYSIS; COMPLEXITY;
D O I：
暂无
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
We consider some poorly studied NP-hard partitioning problems. The paper purpose is to present a short survey on some new results on efficient algorithms with performance guarantees for their solutions.
引用
收藏
页码：87 / 90
页数：4
相关论文
共 50 条
  • [1] Typical performance of approximation algorithms for NP-hard problems
    Takabe, Satoshi
    Hukushima, Koji
    [J]. JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2016,
  • [2] SOME OBSERVATIONS ON THE PROBABILISTIC ALGORITHMS AND NP-HARD PROBLEMS
    KO, KI
    [J]. INFORMATION PROCESSING LETTERS, 1982, 14 (01) : 39 - 43
  • [3] Which NP-hard optimization problems admit non-trivial efficient approximation algorithms?
    Håstad, J
    [J]. AUTOMATA LANGUAGES AND PROGRAMMING, 2000, 1853 : 235 - 235
  • [4] Approximation of some NP-hard optimization problems by finite machines, in probability
    Hong, DW
    Birget, JC
    [J]. THEORETICAL COMPUTER SCIENCE, 2001, 259 (1-2) : 323 - 339
  • [5] NP-hard approximation problems in overlapping clustering
    Barthélemy J.-P.
    Brucker F.
    [J]. Journal of Classification, 2001, 18 (2) : 159 - 183
  • [6] NP-hard approximation problems in overlapping clustering
    Barthélemy, JP
    Brucker, F
    [J]. JOURNAL OF CLASSIFICATION, 2001, 18 (02) : 159 - 183
  • [7] Exact algorithms for NP-hard problems: A survey
    Woeginger, GJ
    [J]. COMBINATORIAL OPTIMIZATION - EUREKA, YOU SHRINK: PAPERS DEDICATED TO JACK EDMONDS, 2003, 2570 : 185 - 207
  • [8] 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
  • [9] SOME NP-HARD POLYGON DECOMPOSITION PROBLEMS
    OROURKE, J
    SUPOWIT, KJ
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1983, 29 (02) : 181 - 190
  • [10] 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)
12345