The problem of compatible representatives
Donald E. Knuth, Arvind Raghunathan
Abstract
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.
Create a lesson
Related papers
A Simple Subquadratic Cut Query Protocol for Directed Reachability
Henry Fleischmann, Sagnik Mukhopadhyay, Swagato Sanyal
Online Edge-Weighted Matching Beyond 0.55
Alireza Farhadi, Mohammad Hajiaghayi
Nonuniform Buy-at-Bulk Network Design: Improved Approximation and LP Integrality Gap
Iman Gholami, MohammadTaghi Hajiaghayi
Prophet Secretary for Matroids and XOS Valuations: A Strict Separation at 1-1/e
Hossein Esfandiari, MohammadTaghi Hajiaghayi
Deterministic Fault-Tolerant Connectivity Oracles with Subquadratic Space
Merav Parter, Elad Tzalik
The 3-Uniform Hyperclique Hypothesis is False
Timothy M. Chan, Reina Itakura, Zhiyuan Ma et al.