Image de couverture de livre

A nearly optimal randomized algorithm for explorable heap selection

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Borst, Sander, Dadush, Daniel, Huiberts, Sophie, Kashaev, Danish
Format:	Preprint
Publié:	2022
Sujets:	Data Structures and Algorithms Optimization and Control
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Online Matching on $3$-Uniform Hypergraphs
par: Borst, Sander, et autres
Publié: (2024)

Improved Online Load Balancing in the Two-Norm
par: Borst, Sander, et autres
Publié: (2025)

Strongly Polynomial Frame Scaling to High Precision
par: Dadush, Daniel, et autres
Publié: (2024)

Beyond Smoothed Analysis: Analyzing the Simplex Method by the Book
par: Bach, Eleon, et autres
Publié: (2025)

Interior point methods are not worse than Simplex
par: Allamigeon, Xavier, et autres
Publié: (2022)

On computing approximate Lewis weights
par: Apers, Simon, et autres
Publié: (2024)

A quantum central path algorithm for linear optimization
par: Augustino, Brandon, et autres
Publié: (2023)

Availability is all you need: achieving optimal regret with minimal information for dynamic matching
par: Kerimov, Süleyman, et autres
Publié: (2025)

A rounding and clustering-based exact algorithm for the p-center problem
par: Ales, Zacharie, et autres
Publié: (2024)

Parameterized algorithms for block-structured integer programs with large entries
par: Cslovjecsek, Jana, et autres
Publié: (2023)

Convex optimization with $p$-norm oracles
par: Adil, Deeksha, et autres
Publié: (2024)

Optimized methods for composite optimization: a reduction perspective
par: Bok, Jinho, et autres
Publié: (2025)

Assortment optimization given basket shopping behavior using the Ising model
par: Vasilyev, Andrey, et autres
Publié: (2025)

Selfish, Local and Online Scheduling via Vector Fitting
par: Kashaev, Danish
Publié: (2025)

Quantum speedups for linear programming via interior point methods
par: Apers, Simon, et autres
Publié: (2023)

Optimal Smoothed Analysis of the Simplex Method
par: Bach, Eleon, et autres
Publié: (2025)

Improved Speed via Regional Fulfillment
par: Hathcock, Daniel, et autres
Publié: (2026)

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

An Efficient Algorithm for Minimizing Ordered Norms in Fractional Load Balancing
par: Blankenburg, Daniel, et autres
Publié: (2025)

A Decomposition Theorem for Dynamic Flows
par: Graf, Lukas, et autres
Publié: (2024)

A Faster Parametric Search for the Integral Quickest Transshipment Problem
par: Anapolska, Mariia, et autres
Publié: (2025)

A Variational-Calculus Approach to Online Algorithm Design and Analysis
par: Xu, Pan
Publié: (2025)

A First Order Method for Linear Programming Parameterized by Circuit Imbalance
par: Cole, Richard, et autres
Publié: (2023)

A Unified Algorithmic Framework for Dynamic Assortment Optimization under MNL Choice
par: Sun, Shuo, et autres
Publié: (2024)

A Two-Layer Framework for Joint Online Configuration Selection and Admission Control
par: Shen, Owen, et autres
Publié: (2026)

Quantum speedups for stochastic optimization
par: Sidford, Aaron, et autres
Publié: (2023)

Expanding the reach of quantum optimization with fermionic embeddings
par: Zhao, Andrew, et autres
Publié: (2023)

Online Bipartite Matching with Advice: Tight Robustness-Consistency Tradeoffs for the Two-Stage Model
par: Jin, Billy, et autres
Publié: (2022)

Online Decision Making with Fairness over Time
par: Chen, Rui, et autres
Publié: (2022)

Solving the Probabilistic Profitable Tour Problem on a Tree
par: Angelelli, Enrico, et autres
Publié: (2022)

Fair Assortment Planning
par: Chen, Qinyi, et autres
Publié: (2022)

Accelerated first-order methods for a class of semidefinite programs
par: Wang, Alex L., et autres
Publié: (2022)

(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs
par: Hunkenschröder, Christoph, et autres
Publié: (2025)

Computational complexity of the recoverable robust shortest path problem in acyclic digraphs
par: Kasperski, Adam, et autres
Publié: (2024)

Generalized Assignment and Knapsack Problems in the Random-Order Model
par: Klimm, Max, et autres
Publié: (2025)

Radial Isotropic Position via an Implicit Newton's Method
par: Jambulapati, Arun, et autres
Publié: (2025)

An Optimal Algorithm for the Stacker Crane Problem on Fixed Topologies
par: Chen, Yike, et autres
Publié: (2024)

Balancing Gradient and Hessian Queries in Non-Convex Optimization
par: Adil, Deeksha, et autres
Publié: (2025)

Parameterized Complexity of Scheduling Problems in Robotic Process Automation
par: Dvořák, Michal, et autres
Publié: (2026)

Deriving the Gradients of Some Popular Optimal Transport Algorithms
par: Xie, Fangzhou
Publié: (2025)