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

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 exist...

Full description

Saved in:
Bibliographic Details
Published inIEICE Transactions on Information and Systems Vol. E108.D; no. 3; pp. 221 - 228
Main Authors MITSUBOSHI, Ryotaro, TAKIMOTO, Eiji, HATANO, Kohei
Format Journal Article
LanguageEnglish
Published Tokyo The Institute of Electronics, Information and Communication Engineers 01.03.2025
Japan Science and Technology Agency
Subjects
Algorithms
Approximation
Combinatorial analysis
Frank-Wolfe algorithms
metarounding
online combinatorial linear optimization
Optimization
Online AccessGet full text
ISSN0916-8532
1745-1361
DOI10.1587/transinf.2024FCP0006

Cover

More Information
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0916-8532
1745-1361
DOI:10.1587/transinf.2024FCP0006