CORE
🇺🇦Â
 make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
research
Sublinear Estimation of Weighted Matchings in Dynamic Data Streams
Authors
A. McGregor
A. McGregor
+12Â more
C. Konrad
D. Gavinsky
J. Feigenbaum
K. Ahn
K. Ahn
L. Epstein
M. Crouch
M. Zelke
N. Nisan
R. Uehara
W. Tutte
Z. Bar-Yossef
Publication date
1 January 2015
Publisher
Doi
Cite
View
on
arXiv
Abstract
This paper presents an algorithm for estimating the weight of a maximum weighted matching by augmenting any estimation routine for the size of an unweighted matching. The algorithm is implementable in any streaming model including dynamic graph streams. We also give the first constant estimation for the maximum matching size in a dynamic graph stream for planar graphs (or any graph with bounded arboricity) using
O
~
(
n
4
/
5
)
\tilde{O}(n^{4/5})
O
~
(
n
4/5
)
space which also extends to weighted matching. Using previous results by Kapralov, Khanna, and Sudan (2014) we obtain a
p
o
l
y
l
o
g
(
n
)
\mathrm{polylog}(n)
polylog
(
n
)
approximation for general graphs using
p
o
l
y
l
o
g
(
n
)
\mathrm{polylog}(n)
polylog
(
n
)
space in random order streams, respectively. In addition, we give a space lower bound of
Ω
(
n
1
−
ε
)
\Omega(n^{1-\varepsilon})
Ω
(
n
1
−
ε
)
for any randomized algorithm estimating the size of a maximum matching up to a
1
+
O
(
ε
)
1+O(\varepsilon)
1
+
O
(
ε
)
factor for adversarial streams
Similar works
Full text
Available Versions
Archivio della ricerca- Università di Roma La Sapienza
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:iris.uniroma1.it:11573/108...
Last time updated on 20/03/2018
Crossref
See this paper in CORE
Go to the repository landing page
Download from data provider
info:doi/10.1007%2F978-3-662-4...
Last time updated on 14/03/2019