Imagen de Portada

Controlling tail risk in two-slope ski rental

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Cui, Qiming, Dinitz, Michael
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Ski Rental with Distributional Predictions of Unknown Quality
por: Cui, Qiming, et al.
Publicado: (2026)

Tree Search With Predictions
por: Dinitz, Michael, et al.
Publicado: (2026)

Learning-Augmented Online Algorithms for Nonclairvoyant Joint Replenishment Problem with Deadlines
por: Dinitz, Michael, et al.
Publicado: (2025)

Almost Tight Bounds for Differentially Private Densest Subgraph
por: Dinitz, Michael, et al.
Publicado: (2023)

A Generalized Binary Tree Mechanism for Differentially Private Approximation of All-Pair Distances
por: Dinitz, Michael, et al.
Publicado: (2025)

Approximation Algorithms for Optimal Hopsets
por: Dinitz, Michael, et al.
Publicado: (2025)

The Steiner Shortest Path Tree Problem
por: Asher, Omer, et al.
Publicado: (2025)

Differentially Private Algorithms for Graph Cuts: A Shifting Mechanism Approach and More
por: Chandra, Rishi, et al.
Publicado: (2024)

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

Differentially Private Matchings
por: Dinitz, Michael, et al.
Publicado: (2025)

Light Edge Fault Tolerant Graph Spanners
por: Bodwin, Greg, et al.
Publicado: (2025)

Binary Search with Distributional Predictions
por: Dinitz, Michael, et al.
Publicado: (2024)

Parallel Set Cover and Hypergraph Matching via Uniform Random Sampling
por: Dhulipala, Laxman, et al.
Publicado: (2024)

Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks
por: Ferreira, Miguel, et al.
Publicado: (2025)

Eulerian-spanning set and coboundary operator: An investigation of maxcut beyond planar graphs
por: Fang, Qiming, et al.
Publicado: (2026)

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

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

Efficient algorithm for linear diophantine equations in two variables
por: Deora, Mayank, et al.
Publicado: (2025)

An FPRAS for two terminal reliability in directed acyclic graphs
por: Feng, Weiming, et al.
Publicado: (2023)

Faster two-dimensional pattern matching with $k$ mismatches
por: Ellert, Jonas, et al.
Publicado: (2024)

When to Identify Is to Control: On the Controllability of Combinatorial Optimization Problems
por: Klimm, Max, et al.
Publicado: (2026)

Linear-space LCS enumeration with quadratic-time delay for two strings
por: Sakai, Yoshifumi
Publicado: (2025)

Routing-Controlled Spanners
por: Grigorescu, Elena, et al.
Publicado: (2024)

Near-optimal streaming approximation for Max-DICUT in sublinear space using two passes
por: Velusamy, Santhoshini
Publicado: (2025)

On the Efficient Discovery of Maximum $k$-Defective Biclique
por: Cui, Donghang, et al.
Publicado: (2025)

Combinatorics of Palindromes
por: Itzhaki, Michael
Publicado: (2025)

Asymptotically Optimal Representation of Palindromic Structure
por: Itzhaki, Michael
Publicado: (2024)

Thinning to improve two-sample discrepancy
por: Smirnov, Gleb, et al.
Publicado: (2025)

Power laws and power-of-two-choices
por: Redlich, Amanda
Publicado: (2026)

The landscape of compressibility measures for two-dimensional data
por: Carfagna, Lorenzo, et al.
Publicado: (2023)

Spanning and Metric Tree Covers Parameterized by Treewidth
por: Elkin, Michael, et al.
Publicado: (2025)

Singing a MIS
por: Irani, Sandy, et al.
Publicado: (2025)

Explicit Combinatoric Structures of Palindromes and Chromatic Number of Restriction Graphs
por: Amir, Amihood, et al.
Publicado: (2024)

Approximation Algorithms for Steiner Connectivity Augmentation
por: Hathcock, Daniel, et al.
Publicado: (2023)

Time, Message and Memory-Optimal Distributed Minimum Spanning Tree and Partwise Aggregation
por: Goldenfeld, Michael Elkin Tanya
Publicado: (2026)

Path-Reporting Distance Oracles with Logarithmic Stretch and Size O(n loglog n)
por: Elkin, Michael, et al.
Publicado: (2023)

Almost Linear Size Edit Distance Sketch
por: Koucký, Michal, et al.
Publicado: (2024)

Deterministic Simple $(Δ+\varepsilonα)$-Edge-Coloring in Near-Linear Time
por: Elkin, Michael, et al.
Publicado: (2024)

MagnifierSketch: Quantile Estimation Centered at One Point
por: Guo, Jiarui, et al.
Publicado: (2025)

Faster optimal univariate microgaggregation
por: Stamm, Felix I., et al.
Publicado: (2024)