Creative Commons Attribution-NoDerivs 3.0 Unported license (CC BY-ND 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2008.1312
URN: urn:nbn:de:0030-drops-13128
URL: https://drops.dagstuhl.de/opus/volltexte/2008/1312/
Zelke, Mariano
Weighted Matching in the Semi-Streaming Model
| pdf-format: |
|
Abstract
We reduce the best known approximation ratio for finding a weightedmatching of a graph using a one-pass semi-streaming algorithm from
5.828 to 5.585. The semi-streaming model forbids random access to
the input and restricts the memory to
$mathcal{O(ncdotmbox{polylog,n)$ bits. It was introduced by
Muthukrishnan in 2003 and is appropriate when dealing with massive
graphs.
BibTeX - Entry
@InProceedings{zelke:LIPIcs:2008:1312,
author = {Mariano Zelke},
title = {{Weighted Matching in the Semi-Streaming Model}},
booktitle = {25th International Symposium on Theoretical Aspects of Computer Science},
pages = {669--680},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-06-4},
ISSN = {1868-8969},
year = {2008},
volume = {1},
editor = {Susanne Albers and Pascal Weil},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2008/1312},
URN = {urn:nbn:de:0030-drops-13128},
doi = {10.4230/LIPIcs.STACS.2008.1312},
annote = {Keywords: Semi-streaming algorithm, matching, approximation algorithm, graph algorithm}
}
| Keywords: | Semi-streaming algorithm, matching, approximation algorithm, graph algorithm | |
| Seminar: | 25th International Symposium on Theoretical Aspects of Computer Science | |
| Issue date: | 2008 | |
| Date of publication: | 06.02.2008 |
