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.18752
  4. Cited By
Competitive Algorithms for Online Knapsack with Succinct Predictions

Competitive Algorithms for Online Knapsack with Succinct Predictions

26 June 2024
Mohammadreza Daneshvaramoli
Helia Karisani
Adam Lechowicz
Bo Sun
Cameron Musco
Mohammad Hajiesmaili
ArXivPDFHTML

Papers citing "Competitive Algorithms for Online Knapsack with Succinct Predictions"

2 / 2 papers shown
Title
Time Fairness in Online Knapsack Problems
Time Fairness in Online Knapsack Problems
Adam Lechowicz
Rik Sengupta
Bo Sun
Shahin Kamali
Mohammad Hajiesmaili
FaML
46
3
0
22 May 2023
Paging with Succinct Predictions
Paging with Succinct Predictions
A. Antoniadis
J. Boyar
Marek Eliáš
Lene M. Favrholdt
R. Hoeksma
Kim S. Larsen
Adam Polak
Bertrand Simon
OOD
26
15
0
06 Oct 2022
1