Anzeige
Erschienen in:
2015 | OriginalPaper | Buchkapitel
Choice Is Hard
verfasst von : Esther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Matthew J. Katz, Joseph S. B. Mitchell, Marina Simakov
Erschienen in: Algorithms and Computation
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Abstract
Let \(P=\{C_1,C_2,\ldots , C_n\}\) be a set of color classes, where each color class \(C_i\) consists of a pair of objects. We focus on two problems in which the objects are points on the line. In the first problem (rainbow minmax gap), given P, one needs to select exactly one point from each color class, such that the maximum distance between a pair of consecutive selected points is minimized. This problem was studied by Consuegra and Narasimhan, who left the question of its complexity unresolved. We prove that it is NP-hard. For our proof we obtain the following auxiliary result. A 3-SAT formula is an LSAT formula if each clause (viewed as a set of literals) intersects at most one other clause, and, moreover, if two clauses intersect, then they have exactly one literal in common. We prove that the problem of deciding whether an LSAT formula is satisfiable or not is NP-complete. We present two additional applications of the LSAT result, namely, to rainbow piercing and rainbow covering.
In the second problem (covering color classes with intervals), given P, one needs to find a minimum-cardinality set \(\mathcal {I}\) of intervals, such that exactly one point from each color class is covered by an interval in \(\mathcal {I}\). Motivated by a problem in storage systems, this problem has received significant attention. Here, we settle the complexity question by proving that it is NP-hard.