scientific article
From MaRDI portal
DOI10.4086/toc.2012.v008a026zbMath1297.68256OpenAlexW2289215623MaRDI QIDQ3191565
Aris Anagnostopoulos, Ravi Kumar, Anirban Dasgupta
Publication date: 6 October 2014
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4086/toc.2012.v008a026
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items
Co-Clustering Under the Maximum Norm, Parameterized \(k\)-clustering: tractability island, Co-clustering under the maximum norm, Approximation Algorithms for Tensor Clustering