Quantizers and the worst-case Euclidean traveling salesman problem

This publication has 20 references indexed in Scilit:

• A lower bound on the average error of vector quantizers (Corresp.)
  IEEE Transactions on Information Theory, 1985
• On the Voronoi Regions of Certain Lattices
  SIAM Journal on Algebraic Discrete Methods, 1984
• A partitioning algorithm for minimum weighted Euclidean matching
  Information Processing Letters, 1984
• The Optimal Lattice Quantizer in Three Dimensions
  SIAM Journal on Algebraic Discrete Methods, 1983
• Fast quantizing and decoding and algorithms for lattice quantizers and codes
  IEEE Transactions on Information Theory, 1982
• Voronoi regions of lattices, second moments of polytopes, and quantization
  IEEE Transactions on Information Theory, 1982
• On Steiner trees for bounded point sets
  Geometriae Dedicata, 1981
• Asymptotically optimal block quantization
  IEEE Transactions on Information Theory, 1979
• The shortest path and the shortest road through n points
  Mathematika, 1955
• Expected Travel Among Random Points in a Region
  Calcutta Statistical Association Bulletin, 1949