4 citations · 6 across the 4 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2007
Weighted Matching in the Semi-Streaming Model
Mariano Zelke
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 forb…
cs.DM2007
Optimal Per-Edge Processing Times in the Semi-Streaming Model
Mariano Zelke
We present semi-streaming algorithms for basic graph problems that have optimal per-edge processing times and therefore surpass all previous semi-streaming algorithms for these tas…