An Improved Metarounding Algorithm via Frank-Wolfe

Ryotaro Mitsuboshi, Kohei Hatano, Eiji Takimoto

Abstract: Metarounding is an approach to convert an approximation algorithm for linear optimization over some combinatorial classes to an online linear optimization algorithm for the same class. We propose a new metarounding algorithm under a natural assumption that a relax-based approximation algorithm exists for the combinatorial class. Our algorithm is much more efficient in both theoretical and practical aspects.