Login / Signup

Nearly Optimal Communication and Query Complexity of Bipartite Matching.

Joakim BlikstadJan van den BrandYuval EfronSagnik MukhopadhyayDanupon Nanongkai
Published in: FOCS (2022)
Keyphrases
  • bipartite matching
  • query complexity
  • dynamic programming
  • machine learning
  • optimal solution
  • xml documents
  • active learning
  • multi objective
  • shortest path
  • data complexity
  • membership queries
  • greedy heuristic