On a dispersion problem in grid labeling

Given k labelings of a finite d-dimensional grid, define the combined distance between two labels to be the sum of the 1-distance between the two labels in each labeling. We present asymptotically optimal constructions of k labelings of cubical d-dimensional grids which maximize the minimum combined distance.

• Type: Conference
• Year: 2010
• Where: CCCG
• Authors: Minghui Jiang, Vincent Pilaud, Pedro J. Tejada
• Keywords: CCCG 2010, Computational Geometry, Cubical D-dimensional Grids, Finite D-dimensional Grid, Minimum Combined Distance