, where
X
,
Y
, and
Z
are disjoint.
such that no elements
in
M
agree in any coordinate.
for any
[
182
].
[
198
].
The generalized Maximum
k
-Dimensional Matching problem is
approximable within
for any
[
150
].
The constrained variation in which the input is extended with a subset
S
of
T
, and the problem is to find the 3-dimensional matching
that contains the largest number of elements from
S
,
is not approximable within
for some
[
352
].
Viggo Kann