0
喜欢
0
书签
声明论文
Weighted Matching in the Semi-Streaming Model   
摘  要:   Abstract. We reduce the best known approximation ratio for finding a weighted match- ing 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.
发  表:   Computing Research Repository  2007

共享有3个版本

Bibtex
创新指数 
阅读指数 
重现指数 
论文点评
还没有人点评哦

Feedback
Feedback
Feedback
我想反馈:
排行榜