Copertina

The Power of Filling in Balanced Allocations

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Los, Dimitrios, Sauerwald, Thomas, Sylvester, John
Natura:	Preprint
Pubblicazione:	2022
Soggetti:	Discrete Mathematics Data Structures and Algorithms Combinatorics Probability 68W20, 68W27, 68W40, 60C05 G.3; G.2.m; F.2.2
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Mean-Biased Processes for Balanced Allocations
di: Los, Dimitrios, et al.
Pubblicazione: (2023)

An Improved Drift Theorem for Balanced Allocations
di: Los, Dimitrios, et al.
Pubblicazione: (2023)

An asymptotically optimal algorithm for generating bin cardinalities
di: Devroye, Luc, et al.
Pubblicazione: (2024)

On the Approximation Ratio of the $k$-Opt and Lin-Kernighan Algorithm
di: Zhong, Xianghui
Pubblicazione: (2019)

Incremental-Decremental Maximization
di: Disser, Yann, et al.
Pubblicazione: (2025)

The $k$-Opt algorithm for the Traveling Salesman Problem has exponential running time for $k \ge 5$
di: Heimann, Sophia, et al.
Pubblicazione: (2024)

The Bottom-Left Algorithm for the Strip Packing Problem
di: Hougardy, Stefan, et al.
Pubblicazione: (2024)

A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem
di: Heimann, Sophia, et al.
Pubblicazione: (2025)

A 13/6-Approximation for Strip Packing via the Bottom-Left Algorithm
di: Hougardy, Stefan, et al.
Pubblicazione: (2025)

Naively Sorting Evolving Data is Optimal and Robust
di: Giakkoupis, George, et al.
Pubblicazione: (2024)

The Distributional Tail of Worst-Case Quickselect
di: Płecha, Witold
Pubblicazione: (2026)

Revisiting Chazelle's Implementation of the Bottom-Left Heuristic: A Corrected and Rigorous Analysis
di: Michel, Stefan
Pubblicazione: (2025)

Deterministic Algorithm and Faster Algorithm for Submodular Maximization subject to a Matroid Constraint
di: Buchbinder, Niv, et al.
Pubblicazione: (2024)

Extending Exact Integrality Gap Computations for the Metric TSP
di: Cook, William, et al.
Pubblicazione: (2026)

On the PLS-Completeness of $k$-Opt Local Search for the Traveling Salesman Problem
di: Heimann, Sophia, et al.
Pubblicazione: (2026)

How to Compute a Moving Sum
di: Maslen, David K., et al.
Pubblicazione: (2025)

Enumeration Kernels of Polynomial Size for Cuts of Bounded Degree
di: Komusiewicz, Christian, et al.
Pubblicazione: (2023)

Boltzmann sampling and optimal exact-size sampling for directed acyclic graphs
di: Gabryelski, Wojciech, et al.
Pubblicazione: (2026)

Fairness in the k-Server Problem
di: Daneshvaramoli, Mohammadreza, et al.
Pubblicazione: (2025)

Fast sampling of satisfying assignments from random $k$-SAT with applications to connectivity
di: Chen, Zongchen, et al.
Pubblicazione: (2022)

On Identifying Critical Network Edges via Analyzing Changes in Shapes (Curvatures)
di: DasGupta, Bhaskar, et al.
Pubblicazione: (2026)

On the Average-Case Performance of Greedy for Maximum Coverage
di: Balkanski, Eric, et al.
Pubblicazione: (2026)

Computing and Enumerating Minimal Common Supersequences Between Two Strings
di: Sopp, Braeden, et al.
Pubblicazione: (2026)

Searching by Heterogeneous Agents
di: Dereniowski, Dariusz, et al.
Pubblicazione: (2021)

Submodular Maximization over a Matroid $k$-Intersection: Multiplicative Improvement over Greedy
di: Feldman, Moran, et al.
Pubblicazione: (2026)

Searching in trees with monotonic query times
di: Dereniowski, Dariusz, et al.
Pubblicazione: (2024)

A Fast 3-Approximation for the Capacitated Tree Cover Problem with Edge Loads
di: Rockel-Wolff, Benjamin
Pubblicazione: (2024)

Extending the Extension: Deterministic Algorithm for Non-monotone Submodular Maximization
di: Buchbinder, Niv, et al.
Pubblicazione: (2024)

Pliability and Approximating Max-CSPs
di: Romero, Miguel, et al.
Pubblicazione: (2019)

Algorithms for Generating Small Random Samples
di: Cicirello, Vincent A.
Pubblicazione: (2024)

A framework for distributed discrete evacuation strategies
di: Borowiecki, Piotr, et al.
Pubblicazione: (2025)

Dynamic Traffic Assignment for Public Transport with Vehicle Capacities
di: Patzner, Julian, et al.
Pubblicazione: (2024)

Probabilistic Analysis of Edge Elimination for Euclidean TSP
di: Zhong, Xianghui
Pubblicazione: (2018)

A Constant Factor Approximation for Directed Feedback Vertex Set in Graphs of Bounded Genus
di: Sun, Hao
Pubblicazione: (2023)

On some randomized algorithms and their evaluation
di: Yordzhev, Krasimir
Pubblicazione: (2024)

An Explicit and Efficient $O(n^2)$-Time Algorithm for Sorting Sumsets
di: Mundhra, S.
Pubblicazione: (2025)

Amnesiac Flooding: Easy to break, hard to escape
di: Austin, Henry, et al.
Pubblicazione: (2025)

A $5/4$-Approximation for Two-Edge Connectivity
di: Bosch-Calvo, Miguel, et al.
Pubblicazione: (2024)

Nearly Tight Sample Complexity for Matroid Online Contention Resolution
di: Feldman, Moran, et al.
Pubblicazione: (2025)

Residual Prophet Inequalities
di: Correa, Jose, et al.
Pubblicazione: (2025)