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 条
  • [41] Families with Infants: Speeding Up Algorithms for NP-Hard Problems Using FFT
    Golovnev, Alexander
    Kulikov, Alexander S.
    Mihajlin, Ivan
    [J]. ACM TRANSACTIONS ON ALGORITHMS, 2016, 12 (03)
  • [42] On places suitable for applying AI principles in NP-hard graph problems' algorithms
    Kumlander, Deniss
    [J]. Proceedings of the IASTED International Conference on Artificial Intelligence and Applications, 2007, : 284 - 288
  • [43] THE SOLUTION OF SOME RANDOM NP-HARD PROBLEMS IN POLYNOMIAL EXPECTED TIME
    DYER, ME
    FRIEZE, AM
    [J]. JOURNAL OF ALGORITHMS, 1989, 10 (04) : 451 - 489
  • [44] A Heuristic Method for Some NP-hard Robust Combinatorial Optimization Problems
    YANG Xiao\|guang\+1\ \ ZHU Qing\+2 1.Laboratory of Management
    [J]. Journal of Systems Science and Systems Engineering, 1999, (03) : 356 - 363
  • [45] A strategy for evolution of algorithms to increase the computational effectiveness of NP-hard scheduling problems
    Li, DC
    Lin, HK
    Torng, KY
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 88 (02) : 404 - 412
  • [46] On the solution of NP-hard linear complementarity problems
    Joaquim J. Júdice
    Ana M. Faustino
    Isabel Martins Ribeiro
    [J]. Top, 2002, 10 (1) : 125 - 145
  • [47] MULTIVARIATE ALGORITHMICS FOR NP-HARD STRING PROBLEMS
    Bulteau, Laurent
    Hueffner, Falk
    Komusiewicz, Christian
    Niedermeier, Rolf
    [J]. BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE, 2014, (114): : 32 - 73
  • [48] Rigorous Analysis of Heuristics for NP-Hard Problems
    Feige, Uriel
    [J]. PROCEEDINGS OF THE SIXTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2005, : 927 - 927
  • [49] 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
  • [50] Nested Quantum Search and NP-Hard Problems
    Nicolas J. Cerf
    Lov K. Grover
    Colin P. Williams
    [J]. Applicable Algebra in Engineering, Communication and Computing, 2000, 10 : 311 - 338
12345