Imagine we have a bunch of circles $($disks$)$ scattered across a plane. Now, we need to come

up with an algorithm that can find a piercing set for these circles, which we'll call $Q.$ The cool

thing about this piercing set is that its size, denoted by $|$Q$|,$ will always be limited by a

constant multiplied by the size of the smallest piercing set, $k^{*}.$ So$,$ we're basically finding a $Q$

that is a constant times $k^{*}-|Q|$ const$*k^{*}$