Improved Approximation Guarantees for Weighted Matching in the Semi-streaming Model
Article Properties
-
LanguageEnglish
-
DOI (url)
-
Publication Date2011/01/01
-
Indian UGC (journal)
-
Refrences8
-
Citations20
-
Leah Epstein
-
Asaf Levin
-
Julián Mestre
-
Danny Segev
Cite
Epstein, Leah, et al. “Improved Approximation Guarantees for Weighted Matching in the Semi-Streaming Model”. SIAM Journal on Discrete Mathematics, vol. 25, no. 3, 2011, pp. 1251-65, https://doi.org/10.1137/100801901.
Epstein, L., Levin, A., Mestre, J., & Segev, D. (2011). Improved Approximation Guarantees for Weighted Matching in the Semi-streaming Model. SIAM Journal on Discrete Mathematics, 25(3), 1251-1265. https://doi.org/10.1137/100801901
Epstein, Leah, Asaf Levin, Julián Mestre, and Danny Segev. “Improved Approximation Guarantees for Weighted Matching in the Semi-Streaming Model”. SIAM Journal on Discrete Mathematics 25, no. 3 (2011): 1251-65. https://doi.org/10.1137/100801901.
Epstein L, Levin A, Mestre J, Segev D. Improved Approximation Guarantees for Weighted Matching in the Semi-streaming Model. SIAM Journal on Discrete Mathematics. 2011;25(3):1251-65.
Journal Categories
Science
Mathematics
Technology
Engineering (General)
Civil engineering (General)
Technology
Technology (General)
Industrial engineering
Management engineering
Applied mathematics
Quantitative methods
Refrences
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
Implementing weighted b-matching algorithms | ACM Journal of Experimental Algorithmics | 3 | 1999 | |
| Searching in an Unknown Environment: An Optimal Randomized Algorithm for the Cow-Path Problem | Information and Computation |
| 58 | 1996 |
| Online Weighted Matching | Journal of Algorithms | 59 | 1993 | |
| Efficient On-Line Call Control Algorithms | Journal of Algorithms | 15 | 1997 | |
| Graph Distances in the Data-Stream Model | SIAM Journal on Computing |
| 32 | 2009 |
Citations
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
| Improved Bounds for Matching in Random-Order Streams | Theory of Computing Systems |
| 2023 | |
| Maximum Matching Sans Maximal Matching: A New Approach for Finding Maximum Matchings in the Data Stream Model | Algorithmica |
| 2023 | |
| Relaxing the Irrevocability Requirement for Online Graph Algorithms | Algorithmica |
| 2022 | |
A Batch-dynamic Suitor Algorithm for Approximating Maximum Weighted Matching | ACM Journal of Experimental Algorithmics | 2022 | ||
Relative Worst-order Analysis | ACM Computing Surveys |
| 1 | 2021 |
Citations Analysis
The category
Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software 19
is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled Graph stream algorithms and was published in 2014. The most recent citation comes from a 2023 study titled Improved Bounds for Matching in Random-Order Streams. This article reached its peak citation in 2018, with 4 citations. It has been cited in 11 different journals. Among related journals, the Algorithmica cited this research the most, with 6 citations. The chart below illustrates the annual citation trends for this article.