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

Authors:
M. Garey;D. Johnson;H. Witsenhausen
Affiliations:
-;-;-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 9

Fast gapped variants for Lempel--Ziv--Welch compression

Information and Computation
Applying K-harmonic means clustering to the part-machine classification problem

Expert Systems with Applications: An International Journal
Text document clustering based on neighbors

Data & Knowledge Engineering
A new clustering algorithm based on hybrid global optimizationbased on a dynamical systems approach algorithm

Expert Systems with Applications: An International Journal
A robust iterative refinement clustering algorithm with smoothing search space

Knowledge-Based Systems
Comparison of clustering methods: A case study of text-independent speaker modeling

Pattern Recognition Letters
Enhancing technology clustering through heuristics by using patent counts

Expert Systems with Applications: An International Journal
Robust classifying of prokaryotic genomes

Computational Biology and Chemistry
PREACO: A fast ant colony optimization for codebook generation

Applied Soft Computing

Quantified Score

Hi-index	754.84

Visualization

Abstract

A simple (combinatorial) special case of the generalized Lloyd-Max (or quantization) problem is shown to be nondeterministic polynomial (NP)-complete. {em A fortiori}, the general problem of communication theory, in its combinatorial forms, has at least that complexity.