Sciweavers

RSA
2002
87views more  RSA 2002»
14 years 4 days ago
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 expe...
Bae-Shi Huang, Ljubomir Perkovic, Eric Schmutz