Fairness in the k-Server Problem

Documenti analoghi

• The Secretary Problem with Predictions and a Chosen Order
  di: Karisani, Helia, et al.
  Pubblicazione: (2026)
• A Constant Factor Approximation for Directed Feedback Vertex Set in Graphs of Bounded Genus
  di: Sun, Hao
  Pubblicazione: (2023)
• The $k$-Opt algorithm for the Traveling Salesman Problem has exponential running time for $k \ge 5$
  di: Heimann, Sophia, et al.
  Pubblicazione: (2024)
• On the Approximation Ratio of the $k$-Opt and Lin-Kernighan Algorithm
  di: Zhong, Xianghui
  Pubblicazione: (2019)
• A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem
  di: Heimann, Sophia, et al.
  Pubblicazione: (2025)