The complexity of the generalized Lloyd - Max problem

@article{Garey1982TheCO,
  title={The complexity of the generalized Lloyd - Max problem},
  author={M. R. Garey and David S. Johnson and H. Witsenhausen},
  journal={IEEE Trans. Inf. Theory},
  year={1982},
  volume={28},
  pages={255-256}
}
  • M. R. Garey, David S. Johnson, H. Witsenhausen
  • Published 1982
  • Mathematics, Computer Science
  • IEEE Trans. Inf. Theory
  • 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. 

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 128 CITATIONS

    On the Complexity of Designing Distributed Protocols

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Globally optimal bit allocation

    • X. Wu
    • Computer Science
    • [Proceedings] DCC `93: Data Compression Conference
    • 1993

    Branch-and-bound technique for solving optimal clustering

    Algorithms for optimal multi-resolution quantization

    VIEW 2 EXCERPTS
    CITES BACKGROUND

    Coreset Clustering on Small Quantum Computers

    VIEW 1 EXCERPT
    CITES BACKGROUND

    New algorithms for optimal binary vector quantizer design

    FILTER CITATIONS BY YEAR

    1982
    2020

    CITATION STATISTICS

    • 4 Highly Influenced Citations

    • Averaged 10 Citations per year from 2018 through 2020

    References

    Publications referenced by this paper.
    SHOWING 1-3 OF 3 REFERENCES

    Least squares auantization in PCM,

    • S. P. Lloyd
    • unpublished Bell Laboratories manuscripi July 3i,
    • 1957

    Quantization for minimum distortion,

    • J. Max
    • IRE Trams. Inform. Theory, vol. IT-& pp
    • 1960