Improved approximation guarantees for weighted matching in the semi-streaming model

Details Improved approximation guarantees for weighted matching in the semi-streaming model Improved approximation guarantees for weighted matching in the semi-streaming model

2009-07-02

arxiv.org/abs/0907.0305v1

SIAM J. Discrete Math. 25(3): 1251-1265 (2011)

Computer Science

Data Structures and Algorithms

Scientific paper

10.1137/100801901

We study the maximum weight matching problem in the semi-streaming model, and improve on the currently best one-pass algorithm due to Zelke (Proc. of STACS2008, pages 669-680) by devising a deterministic approach whose performance guarantee is 4.91+epsilon. In addition, we study preemptive online algorithms, a sub-class of one-pass algorithms where we are only allowed to maintain a feasible matching in memory at any point in time. All known results prior to Zelke's belong to this sub-class. We provide a lower bound of 4.967 on the competitive ratio of any such deterministic algorithm, and hence show that future improvements will have to store in memory a set of edges which is not necessarily a feasible matching.

Affiliated with

Also associated with

No associations

Rating

Improved approximation guarantees for weighted matching in the semi-streaming model does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Improved approximation guarantees for weighted matching in the semi-streaming model, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Improved approximation guarantees for weighted matching in the semi-streaming model will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-730708