Technical Reports (CIS)
Title
Finding Matchings in the Streaming Model
Document Type
Technical Report
Date of this Version
January 2004
Abstract
This report presents algorithms for finding large matchings in the streaming model. In this model, applicable when dealing with massive graphs, edges are streamed-in in some arbitrary order rather than residing in randomly accessible memory. For ε > 0, we achieve a 1/(1+ε) approximation for maximum cardinality matching and a 1/(2+ε) approximation to maximum weighted matching. Both algorithms use a constant number of passes.
Download
Date Posted: 26 June 2005
Comments
University of Pennsylvania Department of Computer and Information Science Technical Report No. MS-CIS-04-19.