Content deleted Content added
→General linear programming formulation: Fixed so that a_{ji}=(A)_{ji}, see sum in Matrix_multiplication#Definition |
m Open access bot: doi added to citation with #oabot. |
||
Line 28:
== {{Anchor|rainbow}}Rainbow covering and conflict-free covering ==
In some covering problems, the covering should satisfy some additional requirements. In particular, in the '''rainbow covering''' problem, each of the original objects has a "color", and it is required that the covering contains exactly one (or at most one) object of each color. Rainbow covering was studied e.g. for covering points by intervals:<ref>{{Cite journal|last=Arkin|first=Esther M.|last2=Banik|first2=Aritra|last3=Carmi|first3=Paz|last4=Citovsky|first4=Gui|last5=Katz|first5=Matthew J.|last6=Mitchell|first6=Joseph S. B.|last7=Simakov|first7=Marina|date=2018-12-11|title=Selecting and covering colored points|url=http://www.sciencedirect.com/science/article/pii/S0166218X18302695|journal=Discrete Applied Mathematics|language=en|volume=250|pages=75–86|doi=10.1016/j.dam.2018.05.011|issn=0166-218X|doi-access=free}}</ref>
* There is a set ''J'' of ''n'' colored intervals on the real line, and a set ''P'' of points on the real line.
| |||