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. 2406.03574
  4. Cited By
A Simple Learning-Augmented Algorithm for Online Packing with Concave
  Objectives

A Simple Learning-Augmented Algorithm for Online Packing with Concave Objectives

5 June 2024
Elena Grigorescu
Young-San Lin
Maoyuan Song
ArXivPDFHTML

Papers citing "A Simple Learning-Augmented Algorithm for Online Packing with Concave Objectives"

2 / 2 papers shown
Title
Learning-Augmented Algorithms for Online Linear and Semidefinite
  Programming
Learning-Augmented Algorithms for Online Linear and Semidefinite Programming
Elena Grigorescu
Young-San Lin
Sandeep Silwal
Maoyuan Song
Samson Zhou
50
8
0
21 Sep 2022
Online Primal-Dual Algorithms with Predictions for Packing Problems
Online Primal-Dual Algorithms with Predictions for Packing Problems
K. Nguyen
C. Dürr
31
3
0
01 Oct 2021
1