Online Bin Covering with Frequency Predictions
Fuente:
arXiv
Saved in:
| Main Authors: | Berg, Magnus, Kamali, Shahin |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Green Bin Packing
by: Bibbens, Jackson, et al.
Published: (2025)
by: Bibbens, Jackson, et al.
Published: (2025)
Online Bin Packing with Predictions
by: Angelopoulos, Spyros, et al.
Published: (2021)
by: Angelopoulos, Spyros, et al.
Published: (2021)
Comparing the Hardness of Online Minimization and Maximization Problems with Predictions
by: Berg, Magnus
Published: (2024)
by: Berg, Magnus
Published: (2024)
Reconfiguration of Multisets with Applications to Bin Packing
by: Kam, Jeffrey, et al.
Published: (2024)
by: Kam, Jeffrey, et al.
Published: (2024)
Online Computation with Untrusted Advice
by: Angelopoulos, Spyros, et al.
Published: (2019)
by: Angelopoulos, Spyros, et al.
Published: (2019)
Complexity Classes for Online Problems with and without Predictions
by: Berg, Magnus, et al.
Published: (2024)
by: Berg, Magnus, et al.
Published: (2024)
Online Interval Scheduling with Predictions
by: Boyar, Joan, et al.
Published: (2023)
by: Boyar, Joan, et al.
Published: (2023)
Improving Online Bin Covering with Little Advice
by: Brodnik, Andrej, et al.
Published: (2025)
by: Brodnik, Andrej, et al.
Published: (2025)
Online Bin Packing with Item Size Estimates
by: Gehnen, Matthias, et al.
Published: (2025)
by: Gehnen, Matthias, et al.
Published: (2025)
Near-optimal Algorithms for Stochastic Online Bin Packing
by: Ayyadevara, Nikhil, et al.
Published: (2022)
by: Ayyadevara, Nikhil, et al.
Published: (2022)
On the Complexity of Telephone Broadcasting: From Cacti to Bounded Pathwidth Graphs
by: Aminian, Aida, et al.
Published: (2025)
by: Aminian, Aida, et al.
Published: (2025)
Robust Learning-Augmented Dictionaries
by: Zeynali, Ali, et al.
Published: (2024)
by: Zeynali, Ali, et al.
Published: (2024)
Time Fairness in Online Knapsack Problems
by: Lechowicz, Adam, et al.
Published: (2023)
by: Lechowicz, Adam, et al.
Published: (2023)
On the Online Weighted Non-Crossing Matching Problem
by: Boyar, Joan, et al.
Published: (2026)
by: Boyar, Joan, et al.
Published: (2026)
The Support of Bin Packing is Exponential
by: Jansen, Klaus, et al.
Published: (2025)
by: Jansen, Klaus, et al.
Published: (2025)
The Power of Migrations in Dynamic Bin Packing
by: Mellou, Konstantina, et al.
Published: (2024)
by: Mellou, Konstantina, et al.
Published: (2024)
The Online Submodular Cover Problem
by: Gupta, Anupam, et al.
Published: (2025)
by: Gupta, Anupam, et al.
Published: (2025)
Online Computation of String Net Frequency
by: Guo, Peaker, et al.
Published: (2024)
by: Guo, Peaker, et al.
Published: (2024)
Learning-Augmented Online Covering Problems
by: Ameli, Afrouz Jabal, et al.
Published: (2025)
by: Ameli, Afrouz Jabal, et al.
Published: (2025)
Faster and Simpler Online Computation of String Net Frequency
by: Inenaga, Shunsuke
Published: (2024)
by: Inenaga, Shunsuke
Published: (2024)
Dynamic Pricing Algorithms for Online Set Cover
by: Bender, Max, et al.
Published: (2024)
by: Bender, Max, et al.
Published: (2024)
Online Disjoint Set Covers: Randomization is not Necessary
by: Bienkowski, Marcin, et al.
Published: (2024)
by: Bienkowski, Marcin, et al.
Published: (2024)
Bin Packing under Random-Order: Breaking the Barrier of 3/2
by: Hebbar, Anish, et al.
Published: (2024)
by: Hebbar, Anish, et al.
Published: (2024)
On the 2D Demand Bin Packing Problem: Hardness and Approximation Algorithms
by: Albers, Susanne, et al.
Published: (2025)
by: Albers, Susanne, et al.
Published: (2025)
Online Rounding for Set Cover under Subset Arrivals
by: Byrka, Jarosław, et al.
Published: (2025)
by: Byrka, Jarosław, et al.
Published: (2025)
On Hardness and Approximation of Broadcasting in Structured Graphs
by: Bringolf, Jeffrey, et al.
Published: (2025)
by: Bringolf, Jeffrey, et al.
Published: (2025)
Tight (S)ETH-based Lower Bounds for Pseudopolynomial Algorithms for Bin Packing and Multi-Machine Scheduling
by: Bringmann, Karl, et al.
Published: (2026)
by: Bringmann, Karl, et al.
Published: (2026)
Integral Online Algorithms for Set Cover and Load Balancing with Convex Objectives
by: Kesselheim, Thomas, et al.
Published: (2025)
by: Kesselheim, Thomas, et al.
Published: (2025)
The Probability to Hit Every Bin with a Linear Number of Balls
by: Walzer, Stefan
Published: (2024)
by: Walzer, Stefan
Published: (2024)
Improved Approximation Algorithms for Three-Dimensional Bin Packing
by: Kar, Debajyoti, et al.
Published: (2025)
by: Kar, Debajyoti, et al.
Published: (2025)
Beyond Brooks: $(Δ-1)$-Coloring in Semi-Streaming
by: Flin, Maxime, et al.
Published: (2026)
by: Flin, Maxime, et al.
Published: (2026)
Faster Dynamic $(Δ+1)$-Coloring Against Adaptive Adversaries
by: Flin, Maxime, et al.
Published: (2025)
by: Flin, Maxime, et al.
Published: (2025)
Representative set statements for delta-matroids and the Mader delta-matroid
by: Wahlström, Magnus
Published: (2023)
by: Wahlström, Magnus
Published: (2023)
Binned Group Algebra Factorization for Differentially Private Continual Counting
by: Henzinger, Monika, et al.
Published: (2025)
by: Henzinger, Monika, et al.
Published: (2025)
Parameterized Complexity of MinCSP over the Point Algebra
by: Osipov, George, et al.
Published: (2023)
by: Osipov, George, et al.
Published: (2023)
Determinantal Sieving
by: Eiben, Eduard, et al.
Published: (2023)
by: Eiben, Eduard, et al.
Published: (2023)
FPT algorithms over linear delta-matroids with applications
by: Eiben, Eduard, et al.
Published: (2025)
by: Eiben, Eduard, et al.
Published: (2025)
Adaptive Frequency Bin Interval in FFT via Dense Sampling Factor $α$
by: Xu, Haichao
Published: (2024)
by: Xu, Haichao
Published: (2024)
Capacitated Partition Vertex Cover and Partition Edge Cover
by: Dabas, Rajni, et al.
Published: (2025)
by: Dabas, Rajni, et al.
Published: (2025)
Streaming Diameter of High-Dimensional Points
by: Halldórsson, Magnús M., et al.
Published: (2025)
by: Halldórsson, Magnús M., et al.
Published: (2025)
Similar Items
-
Green Bin Packing
by: Bibbens, Jackson, et al.
Published: (2025) -
Online Bin Packing with Predictions
by: Angelopoulos, Spyros, et al.
Published: (2021) -
Comparing the Hardness of Online Minimization and Maximization Problems with Predictions
by: Berg, Magnus
Published: (2024) -
Reconfiguration of Multisets with Applications to Bin Packing
by: Kam, Jeffrey, et al.
Published: (2024) -
Online Computation with Untrusted Advice
by: Angelopoulos, Spyros, et al.
Published: (2019)