Login / Signup

Near-Optimal Dynamic Rounding of Fractional Matchings in Bipartite Graphs.

Sayan BhattacharyaPeter KissAaron SidfordDavid Wajc
Published in: STOC (2024)
Keyphrases
  • bipartite graph
  • maximum cardinality
  • maximum matching
  • link prediction
  • minimum weight
  • linear programming
  • maximum weight
  • machine learning
  • reinforcement learning
  • random walk
  • approximation algorithms