Skip to Main content Skip to Navigation
Conference papers

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

Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [16 references]  Display  Hide  Download
Contributor : Publications Loria Connect in order to contact the contributor
Submitted on : Monday, February 15, 2010 - 10:32:52 AM
Last modification on : Thursday, January 6, 2022 - 2:50:02 PM
Long-term archiving on: : Friday, June 18, 2010 - 8:37:26 PM


Files produced by the author(s)


  • HAL Id : inria-00456411, version 1



Leah Epstein, Asaf Levin, Julián Mestre, Danny Segev. Improved approximation guarantees for weighted matching in the semi-streaming model. 27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010, Inria Nancy Grand Est & Loria, Mar 2010, Nancy, France. pp.347-358. ⟨inria-00456411⟩



Record views


Files downloads