Slični predmeti

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