Geometric set cover problem
id:
geometric-set-cover-problem-245-14899069
title:
Geometric set cover problem
text:
The geometric set cover problem is the special case of the set cover problem in geometric settings. The input is a range space Σ = where X is a universe of points in R d and R is a family of subsets of X called ranges, defined by the intersection of X and geometric shapes such as disks and axis-parallel rectangles. The goal is to select a minimum-size subset C ⊆ R of ranges such that every point in the universe X is covered by some range in C . Given the same range space Σ , a closely related pr
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Geometric_set_cover_problem
date created:
date modified:
2021-09-03T14:05:04Z
main entity:
{"identifier":"Q25304468","url":"https://www.wikidata.org/entity/Q25304468"}
image:
fields total:
13
integrity:
13