Nacionalni portal odprte znanosti

Let ▫$P$▫ be a set of at most ▫$n$▫ points and let ▫$R$▫ be a set of at most ▫$n$▫ geometric ranges, such as disks or rectangles, where each ▫$p \in P$▫ has an associated supply ▫$s_{p} > 0$▫, and each ▫$r \in R$▫ has an associated demand ▫$d_{r} > 0$▫. A (many-to-many) matching is a set ▫${\mathcal ...