Secretary Problems: The Power of a Single Sample

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:ACM-SIAM Symposium on Discrete Algorithms (34. : 2023 : Florenz; Online) Thirty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2023) ; Volume 3 of 7
1. Verfasser: Nuti, Pranav (VerfasserIn)
Weitere Verfasser: Vondrák, Jan (VerfasserIn)
Pages:2023
Format: UnknownFormat
Sprache:eng
Veröffentlicht: 2023
Schlagworte:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Titel Jahr Verfasser
Almost Tight Bounds for Online Facility Location in the Random-Order Model 2023 Kaplan, Haim
Discrepancy Minimization via Regularization 2023 Pesenti, Lucas
Finding Triangles and Other Small Subgraphs in Geometric Intersection Graphs 2023 Chan, Timothy M.
Beating (1-1/e)-Approximation for Weighted Stochastic Matching 2023 Derakhshan, Mahsa
Simplex Range Searching Revisited: How to Shave Logs in Multi-Level Data Structures 2023 Chan, Timothy M.
The Power of Clairvoyance for Multi-Level Aggregation and Set Cover with Delay 2023 Le, Ngoc Mai
4D Range Reporting in the Pointer Machine Model in Almost-Optimal Time 2023 Nekrich, Yakov
Approximate Distance Oracles for Planar Graphs with Subpolynomial Error Dependency 2023 Le, Hung
On (Random-order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs 2023 MacRury, Calum
Packing Cycles in Planar and Bounded-Genus Graphs 2023 Schlomberg, Niklas
Computing Square Colorings on Bounded-Treewidth and Planar Graphs 2023 Agrawal, Akanksha
The Exact Bipartite Matching Polytope Has Exponential Extension Complexity 2023 Jia, Xinrui
Online Prediction in Sub-linear Space 2023 Peng, Binghui
A Polynomial Time Algorithm for Finding a Minimum 4-Partition of a Submodular Function 2023 Hirayama, Tsuyoshi
A Subquadratic nε-approximation for the Continuous Fréchet Distance 2023 Horst, Thijs van der
Online Sorting and Translational Packing of Convex Polygons 2023 Aamand, Anders
Economical Convex Coverings and Applications 2023 Arya, Sunil
Minimizing Completion Times for Stochastic Jobs via Batched Free Times 2023 Gupta, Anupam
Superpolynomial Lower Bounds for Decision Tree Learning and Testing 2023 Koch, Caleb
Lossless Online Rounding for Online Bipartite Matching (Despite its Impossibility) 2023 Buchbinder, Niv
Alle Artikel auflisten