- 【Updated on November 17, 2025】 Integration of CiNii Books into CiNii Research
- Trial version of CiNii Research Knowledge Graph Search feature is available on CiNii Labs
- 【Updated on November 26, 2025】Regarding the recording of “Research Data” and “Evidence Data”
- CiNii Research researchers search function has been released.
- Regarding the suspension of updates to the "BOOK" database data
Online Combinatorial Linear Optimization via a Frank-Wolfe-Based Metarounding Algorithm
-
- MITSUBOSHI Ryotaro
- Department of Informatics, Kyushu University RIKEN AIP
-
- HATANO Kohei
- Department of Informatics, Kyushu University RIKEN AIP
-
- TAKIMOTO Eiji
- Department of Informatics, Kyushu University
Search this article
Description
<p>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.</p>
Journal
-
- IEICE Transactions on Information and Systems
-
IEICE Transactions on Information and Systems E108.D (3), 221-228, 2025-03-01
The Institute of Electronics, Information and Communication Engineers
- Tweet
Details 詳細情報について
-
- CRID
- 1390303395623490176
-
- ISSN
- 17451361
- 09168532
-
- Text Lang
- en
-
- Article Type
- journal article
-
- Data Source
-
- JaLC
- Crossref
- KAKEN
- OpenAIRE
-
- Abstract License Flag
- Disallowed