:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Christianson, Nicolas, Sun, Bo, Low, Steven, Wierman, Adam
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms
Online Access:	https://arxiv.org/abs/2405.09859
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Online Algorithms with Uncertainty-Quantified Predictions
by: Sun, Bo, et al.
Published: (2023)

Online Conversion with Switching Costs: Robust and Learning-Augmented Algorithms
by: Lechowicz, Adam, et al.
Published: (2023)

Learning-Augmented Competitive Algorithms for Spatiotemporal Online Allocation with Deadline Constraints
by: Lechowicz, Adam, et al.
Published: (2024)

Online Smoothed Demand Management
by: Lechowicz, Adam, et al.
Published: (2025)

The Online Pause and Resume Problem: Optimal Algorithms and An Application to Carbon-Aware Load Shifting
by: Lechowicz, Adam, et al.
Published: (2023)

Chasing Convex Functions with Long-term Constraints
by: Lechowicz, Adam, et al.
Published: (2024)

Prediction-Specific Design of Learning-Augmented Algorithms
by: Li, Sizhe, et al.
Published: (2025)

Optimal Decentralized Smoothed Online Convex Optimization
by: Bhuyan, Neelkamal, et al.
Published: (2024)

Best of Both Worlds Guarantees for Smoothed Online Quadratic Optimization
by: Bhuyan, Neelkamal, et al.
Published: (2023)

Risk-Sensitive Online Selection with Bounded Adaptivity
by: Nekouyan, Hossein, et al.
Published: (2025)

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling
by: Das, Rathish, et al.
Published: (2025)

SCaLE: Switching Cost aware Learning and Exploration
by: Bhuyan, Neelkamal, et al.
Published: (2026)

Competitive Online Optimization under Inventory Constraints
by: Lin, Qiulin, et al.
Published: (2019)

Online Flow Time Minimization: Tight Bounds for Non-Preemptive Algorithms
by: Geng, Yutong, et al.
Published: (2025)

Online Rounding Schemes for $ k $-Rental Problems
by: Nekouyan, Hossein, et al.
Published: (2025)

Online Search with Predictions: Pareto-optimal Algorithm and its Applications in Energy Markets
by: Lee, Russell, et al.
Published: (2022)

Online Algorithms with Randomly Infused Advice
by: Emek, Yuval, et al.
Published: (2023)

Sensitivity, Proximity and FPT Algorithms for Exact Matroid Problems
by: Eisenbrand, Friedrich, et al.
Published: (2024)

Density-Sensitive Algorithms for $(Δ+ 1)$-Edge Coloring
by: Bhattacharya, Sayan, et al.
Published: (2023)

The Bron-Kerbosch Algorithm with Vertex Ordering is Output-Sensitive
by: Manoussakis, George
Published: (2019)

Knowing When to Stop Matters: A Unified Algorithm for Online Conversion under Horizon Uncertainty
by: Wang, Yanzhao, et al.
Published: (2025)

Dynamic Pricing Algorithms for Online Set Cover
by: Bender, Max, et al.
Published: (2024)

An Empirical Study of Online Packet Scheduling Algorithms
by: Sakr, Nourhan, et al.
Published: (2016)

Optimal Learning-Augmented Algorithm for Online Bidding
by: Lee, Changyeol, et al.
Published: (2026)

A Radius-Sensitive Approximation Algorithm for Connected Submodular Maximization
by: Cervenjak, Philip, et al.
Published: (2026)

Algorithms for Distance Sensitivity Oracles and other Graph Problems on the PRAM
by: Manoharan, Vignesh, et al.
Published: (2025)

Algorithms for Efficient, Compact Online Data Stream Curation
by: Moreno, Matthew Andres, et al.
Published: (2024)

On the FirstFit Algorithm for Online Unit-Interval Coloring
by: Krekelberg, Bob, et al.
Published: (2025)

Near-optimal Algorithms for Stochastic Online Bin Packing
by: Ayyadevara, Nikhil, et al.
Published: (2022)

Learning-augmented Online Algorithm for Two-level Ski-rental Problem
by: Zhang, Keyuan, et al.
Published: (2024)

High Probability Work Efficient Parallel Algorithms
by: Hutton, Chase, et al.
Published: (2026)

Streaming and Massively Parallel Algorithms for Euclidean Max-Cut
by: Menand, Nicolas, et al.
Published: (2025)

A Polylogarithmic Competitive Algorithm for Stochastic Online Sorting and TSP
by: Kalavas, Andreas, et al.
Published: (2025)

A Polylogarithmic Competitive Algorithm for Stochastic Online Sorting and TSP
by: Kalavas, Andreas, et al.
Published: (2025)

Solving Linear Programs with Fast Online Learning Algorithms
by: Gao, Wenzhi, et al.
Published: (2021)

Integral Online Algorithms for Set Cover and Load Balancing with Convex Objectives
by: Kesselheim, Thomas, et al.
Published: (2025)

Learning-Augmented Online Algorithms for Nonclairvoyant Joint Replenishment Problem with Deadlines
by: Dinitz, Michael, et al.
Published: (2025)

Small-Space Algorithms for the Online Language Distance Problem for Palindromes and Squares
by: Bathie, Gabriel, et al.
Published: (2023)

How to Sort in a Refrigerator: Simple Entropy-Sensitive Strictly In-Place Sorting Algorithms
by: Gila, Ofek, et al.
Published: (2026)

Faster Algorithm for Second (s,t)-mincut and Breaking Quadratic barrier for Dual Edge Sensitivity for (s,t)-mincut
by: Baswana, Surender, et al.
Published: (2025)