Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

RSA
2002

favoriteEmaildiscussreport

87views more RSA 2002»

Inexpensive d-dimensional matchings

13 years 4 months ago

Inexpensive d-dimensional matchings

Download www.math.drexel.edu

: 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

Bae-Shi Huang, Ljubomir Perkovic, Eric Schmutz

Real-time Traffic

Complete D-partite Graph | Maximal Independent Sets | Perfect D-dimensional Matching | RSA 2002 |

claim paper

Related Content

» Fast Inexpensive ContentAddressed Storage in Foundation

» Structural action recognition in body sensor networks distributed classification based on ...

» Externalized Fingerprint Matching

» A New GreyScale Template Image Matching Algorithm Using the CrossSectional Histogram Corre...

» Realtime imagebased 6DOF localization in largescale environments

» A system for highvolume acquisition and matching of fresco fragments reassembling Theran w...

» Bayesian Modeling of Facial Similarity

» An Efficient Lyapunov EquationBased Approach for Generating ReducedOrder Models of Interco...

» Detection of pan and zoom in soccer sequences based on H264AVC motion information

Post Info
More Details (n/a)

Added	23 Dec 2010
Updated	23 Dec 2010
Type	Journal
Year	2002
Where	RSA
Authors	Bae-Shi Huang, Ljubomir Perkovic, Eric Schmutz

Comments (0)