Image de couverture de livre

List Update with Delays or Time Windows

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Azar, Yossi, Lewkowicz, Shahar, Vainstein, Danny
Format:	Preprint
Publié:	2023
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Online Joint Replenishment Problem with Arbitrary Holding and Backlog Costs
par: Azar, Yossi, et autres
Publié: (2025)

Nearly Tight Bounds for the Online Sorting Problem
par: Azar, Yossi, et autres
Publié: (2025)

Load Balancing with Duration Predictions
par: Azar, Yossi, et autres
Publié: (2025)

Transposition is Nearly Optimal for IID List Update
par: Coester, Christian
Publié: (2026)

A 3.3904-Competitive Online Algorithm for List Update with Uniform Costs
par: Basiak, Mateusz, et autres
Publié: (2025)

Orienteering (with Time Windows) on Restricted Graph Classes
par: Buchin, Kevin, et autres
Publié: (2024)

Trading Prophets with Initial Capital
par: Azar, Yossi, et autres
Publié: (2025)

Competitive Bundle Trading
par: Azar, Yossi, et autres
Publié: (2025)

Split Algorithm in Linear Time for the Vehicle Routing Problem with Simultaneous Pickup and Delivery and Time Windows
par: Gibbons, Ethan, et autres
Publié: (2026)

Faster Minimization of Total Weighted Completion Time on Parallel Machines
par: Hermelin, Danny, et autres
Publié: (2025)

An $α$-regret analysis of Adversarial Bilateral Trade
par: Azar, Yossi, et autres
Publié: (2022)

Deterministic Dynamic Maximal Matching in Sublinear Update Time
par: Bernstein, Aaron, et autres
Publié: (2025)

Perfect $L_p$ Sampling with Polylogarithmic Update Time
par: Swartworth, William, et autres
Publié: (2025)

Expander Pruning with Polylogarithmic Worst-Case Recourse and Update Time
par: Meierhans, Simon, et autres
Publié: (2025)

Dynamic Connectivity with Expected Polylogarithmic Worst-Case Update Time
par: Meierhans, Simon, et autres
Publié: (2025)

Approximation Algorithms for Fair Repetitive Scheduling
par: Hermelin, Danny, et autres
Publié: (2025)

Fully Dynamic Set Cover: Worst-Case Recourse and Update Time
par: Bhattacharya, Sayan, et autres
Publié: (2025)

Fully Dynamic $k$-Clustering with Fast Update Time and Small Recourse
par: Bhattacharya, Sayan, et autres
Publié: (2024)

Fully Dynamic Euclidean Bi-Chromatic Matching in Sublinear Update Time
par: Goranci, Gramoz, et autres
Publié: (2025)

Fully Dynamic k-Means Coreset in Near-Optimal Update Time
par: la Tour, Max Dupré, et autres
Publié: (2024)

Fully Dynamic $k$-Median with Near-Optimal Update Time and Recourse
par: Bhattacharya, Sayan, et autres
Publié: (2024)

Interval Selection in Sliding Windows
par: Alexandru, Cezar-Mihail, et autres
Publié: (2024)

Dynamic $(1+ε)$-Approximate Matching Size in Truly Sublinear Update Time
par: Bhattacharya, Sayan, et autres
Publié: (2023)

Improved Approximation Guarantees for Joint Replenishment in Continuous Time
par: Segev, Danny
Publié: (2024)

Delayed-Clairvoyant Flow Time Scheduling via a Borrow Graph Analysis
par: Lindermayr, Alexander, et autres
Publié: (2026)

Fair Center Clustering in Sliding Windows
par: Ceccarello, Matteo, et autres
Publié: (2025)

Fair Clustering in the Sliding Window Model
par: Cohen-Addad, Vincent, et autres
Publié: (2025)

Near-Optimal Dynamic Policies for Joint Replenishment in Continuous/Discrete Time
par: Segev, Danny
Publié: (2025)

RIP Linked List
par: Sonntag, Benoît, et autres
Publié: (2023)

Layered List Labeling
par: Bender, Michael A., et autres
Publié: (2024)

Fully-Dynamic All-Pairs Shortest Paths: Likely Optimal Worst-Case Update Time
par: Mao, Xiao
Publié: (2023)

Dynamic Deterministic Constant-Approximate Distance Oracles with $n^ε$ Worst-Case Update Time
par: Haeupler, Bernhard, et autres
Publié: (2024)

Towards Optimal Output-Sensitive Clique Listing or: Listing Cliques from Smaller Cliques
par: Dalirrooyfard, Mina, et autres
Publié: (2023)

Nearly Optimal List Labeling
par: Bender, Michael A., et autres
Publié: (2024)

New Approximation Guarantees for The Inventory Staggering Problem
par: Alon, Noga, et autres
Publié: (2025)

Optimal Approximate Matrix Multiplication over Sliding Window
par: Xian, Haoming, et autres
Publié: (2025)

Listing 6-Cycles in Sparse Graphs
par: Williams, Virginia Vassilevska, et autres
Publié: (2024)

Approximate Maintenance of Maximum Subarray Sum in the Sliding Window Model
par: Suzuki, Ryo, et autres
Publié: (2026)

Fast computation of permanents over $\mathbb{F}_3$ via $\mathbb{F}_2$ arithmetic
par: Scheinerman, Danny
Publié: (2024)

Online List Labeling with Near-Logarithmic Writes
par: Seybold, Martin P.
Publié: (2024)