Before revision:  Using an example, we show that c-packedness and relative c-packedness are not within a constant factor of each other .
After revision:  For axis-aligned squares instead of disks, a related concept called relative-length was already discussed and it has an exact O(n^3) algorithm. We show that vertex-relative c-packedness and relative c-packedness are not within a constant factor of each other .