Online Combinatorial Linear Optimization via a Frank-Wolfe-Based Metarounding Algorithm

Download PDF
Open Webpage

Ryotaro Mitsuboshi, Kohei Hatano, Eiji Takimoto

Published: 2025, Last Modified: 03 Oct 2025IEICE Trans. Inf. Syst. 2025EveryoneRevisionsBibTeXCC BY-SA 4.0
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.