A Fully-dynamic Approximation Algorithm for Maximum Weight b-Matchings in Graphs

Documenti analoghi

• An Asymptotically Optimal Approximation Algorithm for Multiobjective Submodular Maximization at Scale
  di: Spaeh, Fabian, et al.
  Pubblicazione: (2025)
• A Spanning-Tree-Based Algorithm for Planar Graph Dismantling
  di: You, Fangchen
  Pubblicazione: (2025)
• On the External Validity of Average-Case Analyses of Graph Algorithms
  di: Bläsius, Thomas, et al.
  Pubblicazione: (2022)
• An Efficient Streaming Algorithm for Approximating Graphlet Distributions
  di: Bressan, Marco, et al.
  Pubblicazione: (2026)
• Exact Graph Matching in Correlated Gaussian-Attributed Erdős-Rényi Model
  di: Yang, Joonhyuk, et al.
  Pubblicazione: (2024)