Search results

The disk covering problem asks for the smallest real number r ( n ) {\displaystyle r(n)} such that n {\displaystyle n} disks of radius r ( n ) {\displaystyle...

minimum set cover problem. See randomized rounding#setcover for a detailed explanation. Set covering is equivalent to the hitting set problem. That is seen...

smaller number > 1. (Higher density records all have rattles.) Disk covering problem Square packing in a circle Friedman, Erich, "Circles in Circles"...

The covering problem of Rado is an unsolved problem in geometry concerning covering planar sets by squares. It was formulated in 1928 by Tibor Radó and...

both heuristics for NP-hard optimization problems and polynomial-time distance-based methods. Disk-covering methods are a meta-technique in that they...

smallest-circle problem (also known as minimum covering circle problem, bounding circle problem, least bounding circle problem, smallest enclosing circle problem) is...

1238226. ISBN 0-7695-2040-5. S2CID 796386. W., Weisstein, Eric. "Disk Covering Problem". mathworld.wolfram.com. Retrieved 2018-03-03.{{cite web}}: CS1...

The covering dimension of the disk is thus two. More generally, the n-dimensional Euclidean space E n {\displaystyle \mathbb {E} ^{n}} has covering dimension...

the region. In some variations of the problem, the region is restricted to be convex. For example, a circular disk of radius 1/2 can accommodate any plane...

A Nipkow disk (sometimes Anglicized as Nipkov disk; patented in 1884), also known as scanning disk, is a mechanical, rotating, geometrically operating...

1975, solves this problem with a rotating disk above a base from which a cable extends up, over, and onto the top of the disk. As the disk rotates the plane...

O(n\log ^{4}n)} time for range spaces induced by 2D disks. Set cover problem Vertex cover Lebesgue covering dimension Carathéodory's extension theorem Fowler...

Borsuk's problem on upper and lower bounds for the number of smaller-diameter subsets needed to cover a bounded n-dimensional set. The covering problem of Rado:...

. The optimization problem of finding such a set is called the maximum independent set problem. It is a strongly NP-hard problem. As such, it is unlikely...

symbols instead of Phaistos Disc glyphs. The Phaistos Disc or Phaistos Disk is a disk of fired clay from the island of Crete, Greece, possibly from the middle...

interval I {\displaystyle I} in the real numbers to itself or from a closed disk D {\displaystyle D} to itself. A more general form than the latter is for...

Newton number (after the originator of the problem), and contact number. In general, the kissing number problem seeks the maximum possible kissing number...

Technology (S.M.A.R.T. or SMART) is a monitoring system included in computer hard disk drives (HDDs) and solid-state drives (SSDs). Its a primary function is to...

of covering spaces leading to the Riemann existence theorem. Braid group Monodromy matrix Monodromy theorem Mapping class group (of a punctured disk) König...

specially crafted data on the disk. To address this problem in its predecessors, dm-crypt included provisions for more elaborate, disk encryption-specific modes...