Improved Algorithms for Maximum Coverage in Dynamic and Random Order Streams

Documenti analoghi

• Streaming Algorithms for Bin Packing and Vector Scheduling
  di: Cormode, Graham, et al.
  Pubblicazione: (2019)
• A sufficient condition for characterizing the one-sided testable properties of families of graphs in the Random Neighbour Oracle Model
  di: Awofeso, Christine, et al.
  Pubblicazione: (2025)
• Approximate Minimum Sum Colorings and Maximum $k$-Colorable Subgraphs of Chordal Graphs
  di: DeHaan, Ian, et al.
  Pubblicazione: (2024)
• Approximating Maximum Cut on Interval Graphs and Split Graphs beyond Goemans-Williamson
  di: Ahn, Jungho, et al.
  Pubblicazione: (2025)
• Fast Order Statistics with Group Inequality Testing
  di: Liyanage, Adiesha, et al.
  Pubblicazione: (2025)