ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2310.12629
21
0
v1v2 (latest)

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

19 October 2023
Ryotaro Mitsuboshi
Kohei Hatano
Eiji Takimoto
ArXiv (abs)PDFHTML
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.

View on arXiv
Comments on this paper