ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1811.02760
  4. Cited By
Weighted Matchings via Unweighted Augmentations

Weighted Matchings via Unweighted Augmentations

7 November 2018
Buddhima Gamlath
S. Kale
Slobodan Mitrovic
William Yang Wang
ArXivPDFHTML

Papers citing "Weighted Matchings via Unweighted Augmentations"

12 / 12 papers shown
Title
Streaming Kernel PCA Algorithm With Small Space
Streaming Kernel PCA Algorithm With Small Space
Yichuan Deng
Zhao Song
Zifan Wang
Hangke Zhang
28
3
0
08 Mar 2023
$(1-ε)$-Approximate Maximum Weighted Matching in Distributed,
  Parallel, and Semi-Streaming Settings
(1−ε)(1-ε)(1−ε)-Approximate Maximum Weighted Matching in Distributed, Parallel, and Semi-Streaming Settings
Shang-En Huang
Hsin-Hao Su
35
2
0
29 Dec 2022
Massively Parallel Algorithms for $b$-Matching
Massively Parallel Algorithms for bbb-Matching
M. Ghaffari
Christoph Grunau
Slobodan Mitrovic
FedML
18
6
0
14 Nov 2022
Robust Lower Bounds for Graph Problems in the Blackboard Model of
  Communication
Robust Lower Bounds for Graph Problems in the Blackboard Model of Communication
C. Konrad
Peter Robinson
Viktor Zamaraev
20
1
0
12 Mar 2021
A Massively Parallel Algorithm for Minimum Weight Vertex Cover
A Massively Parallel Algorithm for Minimum Weight Vertex Cover
M. Ghaffari
Ce Jin
Daan Nilis
28
14
0
21 May 2020
Massively Parallel Algorithms for Distance Approximation and Spanners
Massively Parallel Algorithms for Distance Approximation and Spanners
Amartya Shankha Biswas
Michal Dory
M. Ghaffari
Slobodan Mitrović
Yasamin Nazari
26
20
0
02 Mar 2020
Massively Parallel Algorithms for Small Subgraph Counting
Massively Parallel Algorithms for Small Subgraph Counting
Amartya Shankha Biswas
T. Eden
Quanquan C. Liu
Slobodan Mitrović
R. Rubinfeld
33
8
0
19 Feb 2020
Equivalence Classes and Conditional Hardness in Massively Parallel
  Computations
Equivalence Classes and Conditional Hardness in Massively Parallel Computations
Danupon Nanongkai
Michele Scquizzato
21
18
0
07 Jan 2020
New lower bounds for Massively Parallel Computation from query
  complexity
New lower bounds for Massively Parallel Computation from query complexity
Moses Charikar
Weiyun Ma
Li-Yang Tan
20
1
0
05 Jan 2020
Faster Algorithms for Edge Connectivity via Random $2$-Out Contractions
Faster Algorithms for Edge Connectivity via Random 222-Out Contractions
M. Ghaffari
Krzysztof Nowicki
M. Thorup
98
49
0
02 Sep 2019
Distributed Weighted Matching via Randomized Composable Coresets
Distributed Weighted Matching via Randomized Composable Coresets
Sepehr Assadi
M. Bateni
Vahab Mirrokni
14
8
0
05 Jun 2019
Exponentially Faster Massively Parallel Maximal Matching
Exponentially Faster Massively Parallel Maximal Matching
Soheil Behnezhad
Mohammadtaghi Hajiaghayi
David G. Harris
19
59
0
11 Jan 2019
1