Painting the Office

Bruce Reed, David Allwright


A particular instance of a wireless channel assignment problem for office blocks takes this form: If a box is partitioned into cuboids, and each cuboid must be assigned a channel different from those of the cuboids it is in face-to-face contact with, how many channels do you need? We show that the answer may be arbitrarily large.

Full Text: PDF