Weighted Matching in the Semi-Streaming Model

We present an approximation algorithm to find a weighted matching of a graph in the one-pass semi-streaming model. The semi-streaming model forbids random access to the input graph and restricts the memory to bits where n denotes the number of the vertices of the input graph. We obtain an approximat...

Full description

Saved in:
Bibliographic Details
Published in:Algorithmica Vol. 62; no. 1-2; pp. 1 - 20
Main Author: Zelke, Mariano
Format: Journal Article
Language:English
Published: New York Springer-Verlag 01.02.2012
Springer
Subjects:
Algorithm Analysis and Problem Complexity
Algorithmics. Computability. Computer arithmetics
Algorithms
Applied sciences
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
Information retrieval. Graph
Mathematics of Computing
Software
Theoretical computing
Theory of Computation
Matching
Approximation algorithm
Semi-streaming algorithm
Graph algorithm
Streaming
Access control
Random access
Modeling
Weighted graph
Graph matching
ISSN:0178-4617, 1432-0541
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We present an approximation algorithm to find a weighted matching of a graph in the one-pass semi-streaming model. The semi-streaming model forbids random access to the input graph and restricts the memory to bits where n denotes the number of the vertices of the input graph. We obtain an approximation ratio of 5.58 while the previously best algorithm achieves a ratio of 5.82.
ISSN:0178-4617
1432-0541
DOI:10.1007/s00453-010-9438-5