Cover Image

A short note about the learning-augmented secretary problem

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Choo, Davin, Ling, Chun Kai
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Online bipartite matching with imperfect advice
by: Choo, Davin, et al.
Published: (2024)

Subset verification and search algorithms for causal DAGs
by: Choo, Davin, et al.
Published: (2023)

Free-order secretary for two-sided independence systems
by: Bérczi, Kristóf, et al.
Published: (2025)

Some variations of the secretary problem
by: Agrawal, Sarthak, et al.
Published: (2026)

Causal Discovery under Off-Target Interventions
by: Choo, Davin, et al.
Published: (2024)

Online Allocation with Unknown Shared Supply
by: Neoh, Tzeh Yuan, et al.
Published: (2026)

Learning-Augmented Online Bipartite Fractional Matching
by: Choo, Davin, et al.
Published: (2025)

Adaptive Multi-Round Allocation with Stochastic Arrivals
by: Pan, Yuqi, et al.
Published: (2026)

A Partition Cover Approach to Tokenization
by: Lim, Jia Peng, et al.
Published: (2025)

Learning multivariate Gaussians with imperfect advice
by: Bhattacharyya, Arnab, et al.
Published: (2024)

Connectivity augmentation is fixed-parameter tractable
by: Korhonen, Tuukka, et al.
Published: (2026)

Learning bounded-degree polytrees with known skeleton
by: Choo, Davin, et al.
Published: (2023)

A note on the depth of optimal fanout-bounded prefix circuits
by: Sergeev, Igor S.
Published: (2025)

Recursive lattice reduction -- A framework for finding short lattice vectors
by: Aggarwal, Divesh, et al.
Published: (2023)

Heisenberg-limited Hamiltonian learning without short-time control
by: Shin, Myeongjin, et al.
Published: (2026)

Fixed-parameter tractability of Directed Multicut with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation
by: Hatzel, Meike, et al.
Published: (2022)

A note on finding long directed cycles above the minimum degree bound in 2-connected digraphs
by: Czyżewska, Jadwiga, et al.
Published: (2025)

Self-referential instances of the dominating set problem are irreducible
by: Zhou, Guangyan
Published: (2026)

A note on Ordered Ruzsa-Szemerédi graphs
by: Pratt, Kevin
Published: (2025)

Bounded indegree $k$-forests problem and a faster algorithm for directed graph augmentation
by: Arkhipov, Pavel, et al.
Published: (2024)

Learning-augmented Maximum Independent Set
by: Braverman, Vladimir, et al.
Published: (2024)

On the closest pair of points problem
by: Hitz, Martin, et al.
Published: (2026)

A simple and efficient preprocessing step for convex hull problem
by: Heydari, Mohammad, et al.
Published: (2023)

Adaptive Frontier Exploration on Graphs with Applications to Network-Based Disease Testing
by: Choo, Davin, et al.
Published: (2025)

The trace reconstruction problem for spider graphs
by: Sun, Alec, et al.
Published: (2022)

Approximating the shortest path problem with scenarios
by: Kasperski, Adam, et al.
Published: (2018)

A note on the complexity of the picker routing problem in multi-block warehouses and related problems
by: Prunet, Thibault, et al.
Published: (2023)

A $(2+\varepsilon)$-approximation algorithm for the general scheduling problem in quasipolynomial time
by: Armbruster, Alexander, et al.
Published: (2025)

Algorithms for the local and the global postage stamp problem
by: Palais, Léo Colisson, et al.
Published: (2026)

Approximating optimization problems in graphs with locational uncertainty
by: Bougeret, Marin, et al.
Published: (2022)

Faster algorithms for packing forests in graphs and related problems
by: Arkhipov, Pavel, et al.
Published: (2024)

The Densest SWAMP problem: subhypergraphs with arbitrary monotonic partial edge rewards
by: Bengali, Vedangi, et al.
Published: (2025)

To buy or not to buy: deterministic rent-or-buy problems on node-weighted graphs
by: Borst, Sander, et al.
Published: (2025)

Scheduling two types of jobs with minimum makespan
by: Cao, Song, et al.
Published: (2024)

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

Stronger adversaries grow cheaper forests: online node-weighted Steiner problems
by: Borst, Sander, et al.
Published: (2024)

Recoverable robust shortest path problem under interval budgeted uncertainty representations
by: Jackiewicz, Marcel, et al.
Published: (2024)

Minimum sum vertex cover: kernelization and parameterized algorithms
by: Cao, Yixin, et al.
Published: (2024)

Deep Learning Service for Efficient Data Distribution Aware Sorting
by: Zhu, Xiaoke, et al.
Published: (2019)

Binary weights spanning trees and the $k$-red spanning tree problem in linear time
by: Hochbaum, Dorit S.
Published: (2024)