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 stream. In this model, the input graph G =( V , E ) is given as a stream of its edges in some arbitra...

Full description

Saved in:

Bibliographic Details
Published in:	Algorithmica Vol. 63; no. 1-2; pp. 490 - 508
Main Authors:	Eggert, Sebastian, Kliemann, Lasse, Munstermann, Peter, Srivastav, Anand
Format:	Journal Article
Language:	English
Published:	New York Springer-Verlag 01.06.2012 Springer
Subjects:	Algorithm Analysis and Problem Complexity Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Combinatorics Combinatorics. Ordered structures Computer Science Computer science; control theory; systems Computer systems and distributed systems. User interface Computer Systems Organization and Communication Networks Data Structures and Information Theory Exact sciences and technology Graph theory Information retrieval. Graph Mathematics Mathematics of Computing Sciences and techniques of general use Software Theoretical computing Theory of Computation Streaming algorithms Approximation algorithms Bipartite graph matching Approximation schemes Streaming Combinatorial problem Graph theory Approximation algorithm Randomized algorithm Combinatorial optimization Modeling Backtracking Randomization Storage Randomized design Search tree Bipartite graph Deterministic approach Algorithm analysis Graph matching Novelty
ISSN:	0178-4617, 1432-0541
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!