Linear Programming in the Semi-streaming Model with Application to the Maximum Matching Problem
Authors:
- Kook Jin AhnKAKook Jin Ahn
- Sudipto GuhaSGSudipto Guha
Preprint
Abstract
In this paper, we study linear programming based approaches to the maximum matching problem in the semi-streaming model. The semi-streaming model has gained attention as a model for processing massive graphs as the importance of such graphs has increased. This is a model where edges are streamed-in in an adversarial order and we are allowed a space proportional to the number of vertices in a graph. In recent years, there has been several new results in this semi-streaming model. However broad techniques such as linear programming have not been adapted to this model. We present several techniques to adapt and optimize linear programming based approaches in the semi-streaming model with an application to the maximum matching problem. As a consequence, we improve (almost) all previous results on this problem, and also prove new results on interesting variants.Keywords
All Related Versions
This publication has 20 references indexed in Scilit:
- Bipartite Matching in the Semi-streaming ModelAlgorithmica, 2011
- Approximating Maximum Weight Matching in Near-Linear Time2010
- Graph Sparsification in the Semi-streaming Model2009
- Graph Distances in the Data-Stream ModelSIAM Journal on Computing, 2009
- On graph problems in a semi-streaming modelTheoretical Computer Science, 2005
- Computing on data streams1999
- A Decision-Theoretic Generalization of On-Line Learning and an Application to BoostingJournal of Computer and System Sciences, 1997
- On the fractional matching polytope of a hypergraphCombinatorica, 1993
- Short proofs on the matching polyhedronJournal of Combinatorial Theory, Series B, 1983
- Maximum degree and fractional matchings in uniform hypergraphsCombinatorica, 1981