a probability
p(c)
such that
.
a placement
z(c)
in the plane, given as integer
coordinates, such that all records are placed on different points in the plane.
,
where
is the discretized Euclidean distance between the
points
and
.
, that is, one can in polynomial time
find a solution with objective function value at most
[
209
].
Viggo Kann