2017
DOI: 10.4230/lipics.esa.2017.22
|View full text |Cite
|
Sign up to set email alerts
|

Online Algorithms for Maximum Cardinality Matching with Edge Arrivals

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
1
0

Year Published

2020
2020
2021
2021

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 0 publications
0
1
0
Order By: Relevance
“…Any graphs Worst-case (unweighted) 1 2 (tight) bipartite & any graphs [24] 1 ´1 e (tight) [31] ě 1 2 `Ωp1q(any graph) [24] ď 0.591(bipartite graphs) [7] Bayesian (weighted) ě 1 3 (bipartite graphs) ď 4 9 (bipartite graphs) [26] ě 0.337 (any graph) (Theorem 5.3) k matroids. They found an adaptive 1 1 4k´2 -competitive algorithm for this setting.…”
mentioning
confidence: 99%
“…Any graphs Worst-case (unweighted) 1 2 (tight) bipartite & any graphs [24] 1 ´1 e (tight) [31] ě 1 2 `Ωp1q(any graph) [24] ď 0.591(bipartite graphs) [7] Bayesian (weighted) ě 1 3 (bipartite graphs) ď 4 9 (bipartite graphs) [26] ě 0.337 (any graph) (Theorem 5.3) k matroids. They found an adaptive 1 1 4k´2 -competitive algorithm for this setting.…”
mentioning
confidence: 99%