An $n^{O(\log\log n)}$ time approximation scheme for capacitated VRP in the Euclidean plane

Ejemplares similares

• Optimal Fault-Tolerant Spanners in Euclidean and Doubling Metrics: Breaking the $Ω(\log n)$ Lightness Barrier
  por: Le, Hung, et al.
  Publicado: (2023)
• The planar edge-coloring theorem of Vizing in $O(n\log n)$ time
  por: Jędrzejczak, Patryk, et al.
  Publicado: (2025)
• An $O(\log \log n)$-approximate budget feasible mechanism for subadditive valuations
  por: Neogi, Rian, et al.
  Publicado: (2025)
• An O(log n)-Approximation Algorithm for (p,q)-Flexible Graph Connectivity via Independent Rounding
  por: Ibrahimpur, Sharat, et al.
  Publicado: (2025)
• Comments on "$\mathcal{O}(m\cdot n)$ algorithms for the recognition and isomorphism problems on circular-arc graphs"
  por: Krawczyk, Tomasz
  Publicado: (2024)