Copertina

An $\mathcal{O}(\log N)$ Time Algorithm for the Generalized Egg Dropping Problem

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autore principale:	Papadopoulos, Kleitos
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Data Structures and Algorithms
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

An $O(n\log n)$ Algorithm for Single-Item Lot Sizing with a One-Breakpoint All-Units Discount and Non-Increasing Prices
di: Papadopoulos, Kleitos
Pubblicazione: (2025)

An $O(n^5)$-Time Algorithm for Optimal Broadcast Domination
di: Papadopoulos, Kleitos
Pubblicazione: (2026)

A Novel exact algorithm for economic lot-sizing with piecewise linear production costs
di: Papadopoulos, Kleitos
Pubblicazione: (2024)

A faster algorithm for the construction of optimal factoring automata
di: Erlebach, Thomas, et al.
Pubblicazione: (2024)

Algorithms and Complexity of Hedge Cluster Deletion Problems
di: Konstantinidis, Athanasios L., et al.
Pubblicazione: (2025)

Fully dynamic biconnectivity in $\tilde{\mathcal{O}}(\log^2 n)$ time
di: Holm, Jacob, et al.
Pubblicazione: (2025)

Fully Dynamic Connectivity in $O(\log n(\log\log n)^2)$ Amortized Expected Time
di: Huang, Shang-En, et al.
Pubblicazione: (2016)

$O(\log n)$-Approximation Algorithms for Bipartiteness Ratio
di: Soma, Tasuku, et al.
Pubblicazione: (2025)

Space-efficient SLP encoding for $O(\log N)$-time random access
di: Takasaka, Akito, et al.
Pubblicazione: (2024)

On Tight FPT Time Approximation Algorithms for k-Clustering Problems
di: Dai, Han, et al.
Pubblicazione: (2025)

Building a Balanced k-d Tree in O(kn log n) Time
di: Brown, Russell A.
Pubblicazione: (2014)

Polynomial-Time Algorithms for Weaver's Discrepancy Problem in a Dense Regime
di: Jourdan, Ben, et al.
Pubblicazione: (2024)

Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems
di: Bampis, Evripidis, et al.
Pubblicazione: (2025)

Split Algorithm in Linear Time for the Vehicle Routing Problem with Simultaneous Pickup and Delivery and Time Windows
di: Gibbons, Ethan, et al.
Pubblicazione: (2026)

Parsimonious Learning-Augmented Approximations for Dense Instances of $\mathcal{NP}$-hard Problems
di: Bampis, Evripidis, et al.
Pubblicazione: (2024)

An O(1) Space Algorithm for N-Dimensional Tensor Rotation: A Generalization of the Reversal Method
di: Chen, Dexin
Pubblicazione: (2025)

A Framework for Parameterized Subexponential-Subcubic-Time Algorithms for Weighted Problems in Planar Graphs
di: Bentert, Matthias, et al.
Pubblicazione: (2026)

A Polynomial-Time Algorithm for the Next-to-Shortest Path Problem on Positively Weighted Directed Graphs
di: Chen, Kuowen, et al.
Pubblicazione: (2025)

Southwest Tree: A Low-Memory Data Structure for Partial Accumulations by Non-Commutative Invertible Operations
di: Papadopoulos, Nicholas J. C.
Pubblicazione: (2025)

Finding a solution to the Erdős-Ginzburg-Ziv theorem in $O(n\log\log\log n)$ time
di: Leung, Yui Hin Arvin
Pubblicazione: (2025)

Parameterized Algorithms for the Drone Delivery Problem
di: Bartlmae, Simon, et al.
Pubblicazione: (2026)

An Exact Algorithm for the Unanimous Vote Problem
di: Keles, Feyza Duman, et al.
Pubblicazione: (2025)

Lipschitz Continuous Algorithms for Covering Problems
di: Kumabe, Soh, et al.
Pubblicazione: (2023)

Computing the (k+2)-Edge-Connected Components in k-Edge-Connected Digraphs in Subquadratic Time
di: Georgiadis, Loukas, et al.
Pubblicazione: (2026)

PCF Learned Sort: a Learning Augmented Sort Algorithm with $O(n \log\log n)$ Expected Complexity
di: Sato, Atsuki, et al.
Pubblicazione: (2024)

Embedding Planar Graphs into Graphs of Treewidth $O(\log^{3} n)$
di: Chang, Hsien-Chih, et al.
Pubblicazione: (2024)

Hardness and Approximation Algorithms for Balanced Districting Problems
di: Dharangutte, Prathamesh, et al.
Pubblicazione: (2025)

Fast Algorithms for Graph Arboricity and Related Problems
di: Cen, Ruoxu, et al.
Pubblicazione: (2025)

On the Hardness Hierarchy for the $O(n \sqrt{\log n})$ Complexity in the Word RAM
di: Kempa, Dominik, et al.
Pubblicazione: (2025)

An Improved Approximation Algorithm for the Capacitated Arc Routing Problem
di: Zhao, Jingyang, et al.
Pubblicazione: (2025)

Algorithms and Hardness Results for the $(k,\ell)$-Cover Problem
di: Madani, Amirali, et al.
Pubblicazione: (2025)

Sensitivity, Proximity and FPT Algorithms for Exact Matroid Problems
di: Eisenbrand, Friedrich, et al.
Pubblicazione: (2024)

Parameterized Algorithms for the Steiner Arborescence Problem on a Hypercube
di: Mahapatra, Sugyani, et al.
Pubblicazione: (2021)

A Reduction-based Algorithm for the Clique Interdiction Problem
di: Zhu, Chenghao, et al.
Pubblicazione: (2025)

Complexity and Approximation Algorithms for Fixed Charge Transportation Problems
di: Chen, Yong, et al.
Pubblicazione: (2025)

Enhanced Approximation Algorithms for the Capacitated Location Routing Problem
di: Zhao, Jingyang, et al.
Pubblicazione: (2025)

A simpler and parallelizable $O(\sqrt{\log n})$-approximation algorithm for Sparsest Cut
di: Kolmogorov, Vladimir
Pubblicazione: (2023)

LZBE: an LZ-style compressor supporting $O(\log n)$-time random access
di: Shibata, Hiroki, et al.
Pubblicazione: (2025)

Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems
di: Chen, Lin, et al.
Pubblicazione: (2026)

Packing-Inspired Algorithms for Periodic Scheduling Problems with Harmonic Periods
di: Grus, Josef, et al.
Pubblicazione: (2024)