Enumeration Kernels of Polynomial Size for Cuts of Bounded Degree

Documenti analoghi

• A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem
  di: Heimann, Sophia, et al.
  Pubblicazione: (2025)
• Boltzmann sampling and optimal exact-size sampling for directed acyclic graphs
  di: Gabryelski, Wojciech, et al.
  Pubblicazione: (2026)
• The $k$-Opt algorithm for the Traveling Salesman Problem has exponential running time for $k \ge 5$
  di: Heimann, Sophia, et al.
  Pubblicazione: (2024)
• The Bottom-Left Algorithm for the Strip Packing Problem
  di: Hougardy, Stefan, et al.
  Pubblicazione: (2024)
• Extending the Extension: Deterministic Algorithm for Non-monotone Submodular Maximization
  di: Buchbinder, Niv, et al.
  Pubblicazione: (2024)