Linear Programming in the Semi-streaming Model with Application to the Maximum Matching Problem

@inproceedings{Ahn2011LinearPI,
  title={Linear Programming in the Semi-streaming Model with Application to the Maximum Matching Problem},
  author={K. Ahn and Sudipto Guha},
  booktitle={ICALP},
  year={2011}
}
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 semistreaming model. However broad… 
Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond
TLDR
The adversarial-order model is circumvented by exploiting several structural properties of planar graphs, and more generally, graphs with bounded arboricity, and a reduction from the Boolean Hidden Matching Problem is designed to show that there is no randomized streaming algorithm that estimates the size of the maximum matching to within a factor better than 3/2 and uses only o(n1/2) bits of space.
Access to Data and Number of Iterations
TLDR
This article provides an iterative sampling-based algorithm for computing a (1 − ε)-approximation of the weighted nonbipartite maximum matching that uses O(p/ε) rounds of sampling, and O(n1+1/p) space.
Better bounds for matchings in the streaming model
TLDR
Improved bounds for approximating maximum matchings in bipartite graphs in the streaming model are presented and it is shown that a simple fractional load balancing approach achieves approximation ratio.
Analyzing Massive Graphs in the Semi-streaming Model
TLDR
A graph sparsification algorithm in the semi-streaming model, a sparse graph that approximately preserves all the cut values of a graph, and near-linear time algorithms for the $b$-matching problems which were not known before are presented.
Sublinear Estimation of Weighted Matchings in Dynamic Data Streams
TLDR
An algorithm for estimating the weight of a maximum weighted matching by augmenting any estimation routine for the size of an unweighted matching is presented and the first constant estimation for the maximum matching size in a dynamic graph stream for planar graphs using \(\tilde{O}(n 4/5})\) space is given.
Improved Bound for Matching in Random-Order Streams
TLDR
This paper presents an algorithm that computes a 2/3(\sim.66)-approximate matching using only $O(n \log(n)$ space, improving upon both results above.
Kernelization via Sampling with Applications to Finding Matchings and Related Problems in Dynamic Graph Streams
TLDR
This paper presents a simple but powerful subgraph sampling primitive that is applicable in a variety of computational models including dynamic graph streams, and considers a larger family of parameterized problems for which this primitive yields fast, small-space dynamic graph stream algorithms.
Kernelization via Sampling with Applications to Dynamic Graph Streams
TLDR
This paper presents a simple but powerful subgraph sampling primitive that is applicable in a variety of computational models including dynamic graph streams, and considers a larger family of parameterized problems for which this primitive yields fast, small-space dynamic graph stream algorithms.
Bipartite Matching in the Semi-streaming Model
We present the first deterministic 1+ε approximation algorithm for finding a large matching in a bipartite graph in the semi-streaming model which requires only O((1/ε)5) passes over the input
Approximating Semi-matchings in Streaming and in Two-Party Communication
TLDR
There is a hierarchical decomposition of an optimal semi-matching into maximum matchings and this result holds for semi- matchings that do not admit length-two degree-minimizing paths.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 38 REFERENCES
On graph problems in a semi-streaming model
TLDR
In the course of this general study, semi-streaming constant approximation algorithms for the unweighted and weighted matching problems are given, along with a further algorithmic improvement for the bipartite case.
Graph Sparsification in the Semi-streaming Model
TLDR
This paper provides a one pass $\tilde{O}(n/\epsilon^{2})$ space algorithm that produces a sparsification that approximates each cut to a (1 + *** ) factor, and shows that $\Omega(n \log \frac1\ep silon)$ space is necessary for a onePass streaming algorithm to approximate the min-cut, improving upon the *** (n ) lower bound that arises from lower bounds for testing connectivity.
Improved Approximation Guarantees for Weighted Matching in the Semi-streaming Model
TLDR
The maximum weight matching problem in the semi-streaming model is studied, and a deterministic approach is devised whose performance guarantee is 4.91+e.967, showing that future improvements will have to store in memory a set of edges that is not necessarily a feasible matching.
Weighted Matching in the Semi-Streaming Model
TLDR
An approximation algorithm to find a weighted matching of a graph in the one-pass semi-streaming model by restricting the memory to n bits where n denotes the number of the vertices of the input graph.
Laminar Families and Metric Embeddings: Non-bipartite Maximum Matching Problem in the Semi-Streaming Model
TLDR
This paper provides the first FPTAS (polynomial in $n,\frac1\epsilon$) for the maximum matching problem in the semi-streaming model which is efficient in both the running time and the number of passes and can estimate the size of the matching using slightly superlinear space.
Graph Distances in the Data-Stream Model
TLDR
Lower bounds for determining the length of the shortest cycle and other graph properties are proved and two general techniques for speeding up the per-edge computation time of streaming algorithms while increasing the space by only a small factor are discussed.
A linear-time approximation algorithm for weighted matchings in graphs
TLDR
This work presents a linear-time approximation algorithm for the weighted matching problem with a performance ratio arbitrarily close to 2/3, which improves the previously best performance ratio of 1/2.
Bipartite Graph Matchings in the Semi-streaming Model
TLDR
This work presents an algorithm for finding a large matching in a bipartite graph in the semi-streaming model, which finds a \(\frac{1}{1+\epsilon}\)-approximation of a maximum-cardinality matching and uses \(O{({(\frac{ 1}{\ep silon})^8}\) passes over the input stream.
Graph construction and b-matching for semi-supervised learning
TLDR
Experimental results on both artificial data and real benchmark datasets indicate that b-matching produces more robust graphs and therefore provides significantly better prediction accuracy without any significant change in computation time.
Approximating Fractional Multicommodity Flow Independent of the Number of Commodities
  • L. Fleischer
  • Mathematics, Computer Science
    SIAM J. Discret. Math.
  • 2000
TLDR
The first approximation scheme for maximum multicommodity flow that is independent of the number of commodities k is presented, and the algorithm improves upon the run time of previous algorithms by this factor of k, running in ${cal O}^*(\epsilon^{-2}m^2)}$ time.
...
1
2
3
4
...