Exact and Approximate High-Multiplicity Scheduling on Identical Machines

Documenti analoghi

• Mim-Width is paraNP-complete
  di: Bergougnoux, Benjamin, et al.
  Pubblicazione: (2025)
• Simple Combinatorial Construction of the $k^{o(1)}$-Lower Bound for Approximating the Parameterized $k$-Clique
  di: Chen, Yijia, et al.
  Pubblicazione: (2023)
• On weighted graph separation problems and flow-augmentation
  di: Kim, Eun Jung, et al.
  Pubblicazione: (2022)
• Almost Tight Approximation Hardness for Single-Source Directed k-Edge-Connectivity
  di: Liao, Chao, et al.
  Pubblicazione: (2022)
• Steiner Tree Parameterized by Multiway Cut and Even Less
  di: Jansen, Bart M. P., et al.
  Pubblicazione: (2024)