This paper attaches a name to a natural class of combinatorial problems and points out that the class includes many important special cases. One special case, a simple problem of placing nonoverlapping labels on a rectangular map, is shown to be NP-complete.
No takes yet. Share an insight, caveat, or question.
Knuth et al. (1992) studied this question.
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: