Clustering Affine Subspaces: Hardness and Algorithms

DOI10.1137/1.9781611973105.58zbMath1422.68248OpenAlexW4249733622MaRDI QIDQ5741766

Euiwoong Lee, Leonard J. Schulman

Publication date: 15 May 2019

Published in: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611973105.58

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (3)

The complexity of binary matrix completion under diameter constraints ⋮ Linear-time approximation scheme for \(k\)-means clustering of axis-parallel affine subspaces ⋮ Improved separated red-blue center clustering

This page was built for publication: Clustering Affine Subspaces: Hardness and Algorithms