Approximating (k, l)-median clustering for polygonal curves

被引：0
|
作者：
Buchin, Maike [1 ]
Driemel, Anne [2 ]
Rohde, Dennis [3 ]
机构：
[1] Faculty of Mathematics, Ruhr-University Bochum, Germany
[2] Hausdorff Center for Mathematics, University of Bonn, Germany
[3] Faculty of Mathematics, Ruhr-University Bochum, Germany
来源：
Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms | 2021年
关键词：
903.1 Information Sources and Analysis - 921 Mathematics;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Approximation algorithms
引用
收藏
页码：2697 / 2716
相关论文
共 50 条
  • [21] Sequential no-Substitution k-Median-Clustering
    Hess, Tom
    Sabato, Sivan
    INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND STATISTICS, VOL 108, 2020, 108 : 962 - 971
  • [22] Parallel and Efficient Hierarchical k-Median Clustering
    Cohen-Addad, Vincent
    Lattanzi, Silvio
    Norouzi-Fard, Ashkan
    Sohler, Christian
    Svensson, Ola
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 34 (NEURIPS 2021), 2021, 34
  • [23] Efficient Algorithms for Approximating Polygonal Chains
    P. K. Agarwal
    K. R. Varadarajan
    Discrete & Computational Geometry, 2000, 23 : 273 - 291
  • [24] Probabilistic k-Median Clustering in Data Streams
    Lammersen, Christiane
    Schmidt, Melanie
    Sohler, Christian
    THEORY OF COMPUTING SYSTEMS, 2015, 56 (01) : 251 - 290
  • [25] Probabilistic k-Median Clustering in Data Streams
    Christiane Lammersen
    Melanie Schmidt
    Christian Sohler
    Theory of Computing Systems, 2015, 56 : 251 - 290
  • [26] POLYGONAL-APPROXIMATION OF PLANAR CURVES IN THE L1 NORM
    ABDELMALEK, NN
    INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE, 1986, 17 (11) : 1601 - 1608
  • [27] A fast algorithm for approximating the detour of a polygonal chain
    Ebbers-Baumann, A
    Klein, R
    Langetepe, E
    Lingas, A
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2004, 27 (02): : 123 - 134
  • [28] Stability yields a PTAS for k-Median and k-Means Clustering
    Awasthi, Pranjal
    Blum, Avrim
    Sheffet, Or
    2010 IEEE 51ST ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, 2010, : 309 - 318
  • [29] Approximating k-means-type clustering via semidefinite programming
    Peng, Jiming
    Wei, Yu
    SIAM JOURNAL ON OPTIMIZATION, 2007, 18 (01) : 186 - 205
  • [30] Approximating polygonal objects by deformable smooth surfaces
    Cheng, HL
    Tan, T
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2005, PROCEEDINGS, 2005, 3618 : 248 - 259
12345