Covering and packing mixed-integer linear programs with a fixed number of constraints: Approximation and convex hull

Documenti analoghi

• A $5$-Approximation Analysis for the Cover Small Cuts Problem
  di: Simmons, Miles, et al.
  Pubblicazione: (2026)
• Improved Approximation Algorithms for Capacitated Network Design and Flexible Graph Connectivity
  di: Bansal, Ishan, et al.
  Pubblicazione: (2024)
• Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-Means
  di: Friggstad, Zachary, et al.
  Pubblicazione: (2018)
• On the connected (sub)partition polytope
  di: Moura, Phablo F. S., et al.
  Pubblicazione: (2024)
• Shortest Paths without a Map, but with an Entropic Regularizer
  di: Bubeck, Sébastien, et al.
  Pubblicazione: (2022)