The problem of compatible representatives

Simple item page
dc.creatorKnuth, Donald E.
dc.creatorRaghunathan, Arvind
dc.date1992-07-01
dc.date.accessioned2026-07-07T09:12:17Z
dc.date.available2026-07-07T09:12:17Z
dc.descriptionThe 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.
dc.identifierhttps://arxiv.org/abs/cs/9301116
dc.identifierhttp://arxiv.org/abs/cs/9301116
dc.identifierSIAM J. Discrete Math. 5 (1992), no. 3, 422--427
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/151970
dc.subjectData Structures and Algorithms
dc.subjectCombinatorics
dc.titleThe problem of compatible representatives
dc.typetext

Files

Collections

arXiv