Weighted Matching in the Semi-Streaming Model
Discrete Mathematics
2008-02-25 v1 Data Structures and Algorithms
Abstract
We reduce the best known approximation ratio for finding a weighted matching of a graph using a one-pass semi-streaming algorithm from 5.828 to 5.585. The semi-streaming model forbids random access to the input and restricts the memory to O(n*polylog(n)) bits. It was introduced by Muthukrishnan in 2003 and is appropriate when dealing with massive graphs.
Cite
@article{arxiv.0709.3384,
title = {Weighted Matching in the Semi-Streaming Model},
author = {Mariano Zelke},
journal= {arXiv preprint arXiv:0709.3384},
year = {2008}
}
Comments
12 pages, 2 figures