The problem of compatible representatives
数据结构与算法
2008-02-03 v1 组合数学
摘要
The purpose of this note is to attach a name to a natural class of combinatorial problems and to point out that this class includes many important special cases. We also show that a simple problem of placing nonoverlapping labels on a rectangular map is NP-complete.
引用
@article{arxiv.cs/9301116,
title = {The problem of compatible representatives},
author = {Donald E. Knuth and Arvind Raghunathan},
journal= {arXiv preprint arXiv:cs/9301116},
year = {2008}
}