Results 1 
2 of
2
Linear Programming in the Semistreaming Model with Application to the Maximum Matching Problem
, 2012
"... In this paper we study linearprogramming based approaches to the maximum matching problem in the semistreaming model. In this model edges are presented sequentially, possibly in an adversarial order, and we are only allowed to use a small space. The allowed space is near linear in the number of ve ..."
Abstract

Cited by 19 (7 self)
 Add to MetaCart
(Show Context)
In this paper we study linearprogramming based approaches to the maximum matching problem in the semistreaming model. In this model edges are presented sequentially, possibly in an adversarial order, and we are only allowed to use a small space. The allowed space is near linear in the number of vertices (and sublinear in the number of edges) of the input graph. The semistreaming model is relevant in the context of processing of very large graphs. In recent years, there have been several new and exciting results in the semistreaming model. However broad techniques such as linear programming have not been adapted to this model. In this paper we present several techniques to adapt and optimize linearprogramming based approaches in the semistreaming model. We use the maximum matching problem as a foil to demonstrate the e ectiveness of adapting such tools in this model. As a consequence we improve almost all previous results on the semistreaming maximum matching problem. We also prove new results on interesting variants.