Cover Image

A Variational-Calculus Approach to Online Algorithm Design and Analysis

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Xu, Pan
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Stay or Switch: Competitive Online Algorithms for Energy Plan Selection in Energy Markets with Retail Choice
by: Zhai, Jianing, et al.
Published: (2019)

A Two-Layer Framework for Joint Online Configuration Selection and Admission Control
by: Shen, Owen, et al.
Published: (2026)

An Optimal Algorithm for the Stacker Crane Problem on Fixed Topologies
by: Chen, Yike, et al.
Published: (2024)

Online Matching on $3$-Uniform Hypergraphs
by: Borst, Sander, et al.
Published: (2024)

Online Decision Making with Fairness over Time
by: Chen, Rui, et al.
Published: (2022)

Dynamic Batching of Online Arrivals to Leverage Economies of Scale
by: Bhimaraju, Akhil, et al.
Published: (2023)

Dynamic Resource Allocation: Algorithmic Design Principles and Spectrum of Achievable Performances
by: Besbes, Omar, et al.
Published: (2022)

Infrequent Resolving Algorithm for Online Linear Programming
by: Li, Guokai, et al.
Published: (2024)

A Unified Algorithmic Framework for Dynamic Assortment Optimization under MNL Choice
by: Sun, Shuo, et al.
Published: (2024)

Deriving the Gradients of Some Popular Optimal Transport Algorithms
by: Xie, Fangzhou
Published: (2025)

Branch-and-Bound Algorithms as Polynomial-time Approximation Schemes
by: Encz, Koppány István, et al.
Published: (2025)

A Simple Learning-Augmented Algorithm for Online Packing with Concave Objectives
by: Grigorescu, Elena, et al.
Published: (2024)

(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs
by: Hunkenschröder, Christoph, et al.
Published: (2025)

An Efficient Algorithm for Minimizing Ordered Norms in Fractional Load Balancing
by: Blankenburg, Daniel, et al.
Published: (2025)

Two-sided Assortment Optimization: Adaptivity Gaps and Approximation Algorithms
by: Housni, Omar El, et al.
Published: (2024)

Online Bipartite Matching with Advice: Tight Robustness-Consistency Tradeoffs for the Two-Stage Model
by: Jin, Billy, et al.
Published: (2022)

On Approximation of Robust Max-Cut and Related Problems using Randomized Rounding Algorithms
by: Shi, Haoyan, et al.
Published: (2024)

Scalable First-Order Interior Point Trust Region Algorithms for Linearly Constrained Optimization
by: Su, Yuexin, et al.
Published: (2026)

Online Bilevel Optimization: Regret Analysis of Online Alternating Gradient Methods
by: Tarzanagh, Davoud Ataee, et al.
Published: (2022)

Learning-Augmented Algorithms for Online Concave Packing and Convex Covering Problems
by: Grigorescu, Elena, et al.
Published: (2024)

An Efficient Frequency-Based Approach for Maximal Square Detection in Binary Matrices
by: Bhandari, Swastik
Published: (2025)

Cascading-Tree Algorithm for the 0-1 Knapsack Problem (In Memory of Heiner M{ü}ller-Merbach, a Former President of IFORS)
by: Moeini, Mahdi, et al.
Published: (2024)

Online Stochastic Packing with General Correlations
by: Cetin, Sabri, et al.
Published: (2025)

Beyond Smoothed Analysis: Analyzing the Simplex Method by the Book
by: Bach, Eleon, et al.
Published: (2025)

Continuous Non-monotone DR-submodular Maximization with Down-closed Convex Constraint
by: Chen, Shengminjie, et al.
Published: (2023)

A Decomposition Theorem for Dynamic Flows
by: Graf, Lukas, et al.
Published: (2024)

A Faster Parametric Search for the Integral Quickest Transshipment Problem
by: Anapolska, Mariia, et al.
Published: (2025)

A nearly optimal randomized algorithm for explorable heap selection
by: Borst, Sander, et al.
Published: (2022)

A First Order Method for Linear Programming Parameterized by Circuit Imbalance
by: Cole, Richard, et al.
Published: (2023)

A rounding and clustering-based exact algorithm for the p-center problem
by: Ales, Zacharie, et al.
Published: (2024)

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

Diversity-Fair Online Selection
by: Hu, Ming, et al.
Published: (2025)

Online Linear Programming with Replenishment
by: Chen, Yuze, et al.
Published: (2026)

Private Online Learning via Lazy Algorithms
by: Asi, Hilal, et al.
Published: (2024)

Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem
by: Gao, Xuan-Zhao, et al.
Published: (2024)

Min-Max Optimization Is Strictly Easier Than Variational Inequalities
by: Shugart, Henry, et al.
Published: (2025)

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

Generalized Assignment and Knapsack Problems in the Random-Order Model
by: Klimm, Max, et al.
Published: (2025)

Radial Isotropic Position via an Implicit Newton's Method
by: Jambulapati, Arun, et al.
Published: (2025)