The complexity of the generalized Lloyd - Max problem (Corresp.)

DOI10.1109/TIT.1982.1056488zbMath0476.94009OpenAlexW2088912280WikidataQ56674900 ScholiaQ56674900MaRDI QIDQ3932726

Michael R. Garey, H. S. Witsenhausen, David S. Johnson

Publication date: 1982

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.1982.1056488

zbMATH Keywords

quantizationNP-completenessencoding

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Information theory (general) (94A15) Rate-distortion theory in information and communication theory (94A34)

Related Items

Robust classifying of prokaryotic genomes, Fast gapped variants for Lempel-Ziv-Welch compression, An efficient optimization method for solving unsupervised data classification problems, Application of honey-bee mating optimization algorithm on clustering, Soft clustering by convex electoral model, Compressive statistical learning with random feature moments, Statistical learning guarantees for compressive clustering and compressive mixture modeling, \(K\)-harmonic means data clustering with simulated annealing heuristic, \(k\)-means genetic algorithms with greedy genetic operators, \(K\)-harmonic means data clustering with tabu-search method, Unnamed Item