Sign in

On the Robust Communication Complexity of Bipartite Matching.

Sepehr AssadiSoheil Behnezhad
Published in: APPROX-RANDOM (2021)
Keyphrases
  • bipartite matching
  • computational complexity
  • maximum weight
  • minimum cost flow
  • relational databases
  • worst case
  • social networks
  • lower bound
  • optimization algorithm
  • shortest path
  • tabu search