Find link

language:

Find link is a tool written by Edward Betts.

Longer titles found: Geometric set cover problem (view)

searching for Set cover problem 5 found (44 total)

Time complexity (5,003 words) [view diff] exact match in snippet view article find links to article

algorithms. For example, see the known inapproximability results for the set cover problem. The term sub-exponential time is used to express that the running

Gregory Piatetsky-Shapiro (1,359 words) [view diff] exact match in snippet view article find links to article

that secondary index selection is NP-complete by reducing it to a set cover problem. In his dissertation, he proved that the greedy method for set cover

Art gallery problem (2,530 words) [view diff] exact match in snippet view article find links to article

polygon into convex subregions and then reducing the problem to a set cover problem. As Valtr (1998) showed, the set system derived from an art gallery

Token reconfiguration (1,220 words) [view diff] exact match in snippet view article find links to article

reduction is the same one as above, from set cover. However, the set cover problem is restricted to subsets of size at most 3, which is an APX-hard problem

Matroid partitioning (2,048 words) [view diff] exact match in snippet view article find links to article

leaves a maximum intersection. Matroid partitioning is a form of set cover problem, and the corresponding set packing problem (find a maximum number