Inexpensive d-dimensional matchings

: Suppose that independent U 0 1 weights are assigned to the d 2 n2 edges of the complete d-partite graph with n vertices in each of the d = maximal independent sets. Then the expected weight of the minimum-weight perfect d-dimensional matching is at least 3 16 n1- 2/d . We describe a randomized algorithm that finds a perfect d-dimensional matching whose expected weight is at most 5d3 n1- 2/d + d15

• Type: Journal
• Year: 2002
• Where: RSA
• Authors: Bae-Shi Huang, Ljubomir Perkovic, Eric Schmutz
• Keywords: Complete D-partite Graph, Maximal Independent Sets, Perfect D-dimensional Matching, RSA 2002