Improved Approximation Algorithms for Non-Preemptive Throughput Maximization

Documenti analoghi

• On the Approximability of Unsplittable Flow on a Path with Time Windows
  di: Armbruster, Alexander, et al.
  Pubblicazione: (2025)
• Approximating the Maximum Independent Set of Convex Polygons with a Bounded Number of Directions
  di: Grandoni, Fabrizio, et al.
  Pubblicazione: (2024)
• A $(2+\varepsilon)$-approximation algorithm for the general scheduling problem in quasipolynomial time
  di: Armbruster, Alexander, et al.
  Pubblicazione: (2025)
• A $(2+\varepsilon)$-Approximation Algorithm for Metric $k$-Median
  di: Cohen-Addad, Vincent, et al.
  Pubblicazione: (2025)
• An Improved Greedy Approximation for (Metric) $k$-Means
  di: Charikar, Moses, et al.
  Pubblicazione: (2026)